Errors-and-erasures decoding of block codes in hidden Markov channels

C. M. Lee*, Yu-Ted Su

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations


Most investigation on the performance of block codes assume perfect interleaving and memoryless channels that introduce only random errors. Some authors investigate the effect of finite interleaving size on the decoder performance, using a two-state Gilbert-Elliott (GE) model to characterize the channel effect. However, there are circumstances that the burst-error channel of concern can not be properly described by a two-state GE model. This paper extends earlier analysis to investigate the performance of block codes in an environment that can be modeled as an arbitrary finite-state Markov chain.

Original languageEnglish
Pages (from-to)1425-1429
Number of pages5
JournalIEEE Vehicular Technology Conference
Issue number53ND
StatePublished - 1 Jan 2001
EventIEEE VTS 53rd Vehicular Technology Conference (VTS SPRING 2001) - Rhodes, Greece
Duration: 6 May 20019 May 2001

Fingerprint Dive into the research topics of 'Errors-and-erasures decoding of block codes in hidden Markov channels'. Together they form a unique fingerprint.

Cite this