On Sequential Decoding for the Gilbert Channel

V. Sidorenko, Rolf Johannesson, K. Sh Zigangirov

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


It is well-known that the computational performance of sequential decoding deteriorates drastically when channel errors occur in clusters. Hagenauer suggested a feasible modification of sequential decoding which uses a burst-tracking method for better performance. At each step he considers the channel to be memoryless, but with varying probability of error. A different way of using sequential decoding to exploit the memory of a Gilbert channel is presented. A Fano-like metric matched to this channel is used. The methods are investigated by simulating sequential decoding utilizing the stack algorithm. These simulations confirm the feasibility’ of the proposed techniques.

Original languageEnglish
Pages (from-to)1058-1061
Number of pages4
JournalIEEE Transactions on Information Theory
Issue number5
Publication statusPublished - Sep 1988
Externally publishedYes


Dive into the research topics of 'On Sequential Decoding for the Gilbert Channel'. Together they form a unique fingerprint.

Cite this