When are maximum likelihood and minimum distance decoding equivalent for binary contagion channels?

Abstract

We study optimal maximum likelihood block decoding of binary codes sent over binary contagion channels with infinite and finite memory. We derive conditions on the codes and channels parameters under which maximum likelihood and minimum Hamming distance are equivalent. We also note that under these conditions, minimum distance decoding can perform better without the use of channel interleaving.