On Decoding Binary Quasi-Perfect Codes Over Markov Noise Channels

  title={On Decoding Binary Quasi-Perfect Codes Over Markov Noise Channels},
  author={Haider Al-Lawati and Fady Alajaji},
  journal={2007 10th Canadian Workshop on Information Theory (CWIT)},
We study the decoding problem when a binary linear quasi-perfect code is transmitted over a binary channel with additive Markov noise. After examining the properties of the channel block transition distribution, we show a near equivalence relationship between strict maximum likelihood and strict minimum Hamming distance decoding for a range of channel parameters and the code's minimum distance. As a result, an improved minimum distance decoder is proposed and simulations illustrating its… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 11 references

Near-optimality of subcodes of Hamming code s on the two-state Markovian additive channel,

  • M. Hamada
  • IEICE Trans. Fundamentals Electronics, Commun…
  • 2001
1 Excerpt

Modeling burst channels us ing partitioned Fritchman’s Markov models,”IEEE

  • C. Pimentel, I. F. Blake
  • 1998
1 Excerpt

The Theory of Error-Correcting Codes

  • F. J. MacWilliams, N.J.A. Sloane
  • North-Holland, Amsterdam
  • 1977
1 Excerpt

A communication channel modeledon contagion

  • F. Kschischang Ecford, S. Pasupathy
  • IEEE Trans . Inform . Theory

Modeling burst channels using partitioned Fritch - man ’ s Markov models

  • Pimentel, I. F. Blake
  • IEEE Trans . Veh . Technol .

Similar Papers

Loading similar papers…