Performance analysis of block codes in hidden Markov channels

Chang Ming Lee*, Yu-Ted Su, Li Der Jeng

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


Most investigations on the effect of channel memory on the performance of block codes use a two-state Gilbert-Elliott (GE) model to describe the channel behavior. As there are circumstances that the channel of concern can not be properly described by the GE model, there are some recent works on coded performance [5-7] that characterize the channel behavior by a general finite-state Markov chain. This letter presents a new efficient systematic approach to analyze the performance of block codes in such a hidden Markov channel (HMC). An application example is given to predict codeword error probability performance of an RS-coded system in a channel with memory. Numerical results are also provided to validate our analytic results.

Original languageEnglish
Pages (from-to)1-4
Number of pages4
JournalIEEE Transactions on Communications
Issue number1
StatePublished - 1 Jan 2008


  • Gilbert-Elliott (GE) model
  • Hidden Markov channel (HMC)
  • Interleaver

Fingerprint Dive into the research topics of 'Performance analysis of block codes in hidden Markov channels'. Together they form a unique fingerprint.

Cite this