Information set decoding complexity for linear codes in bursty channels with side information
Wonjin Sung, J.T. Coffey · 2002
General decoding algorithms for linear codes that have less complexity than exponential search have been studied by many researchers and exact complexities are known for the memoryless channel. Among the various decoding strategies for linear codes, the information set decoding algorithm has complexity that is significantly lower than that for most other general algorithms over most code rates. The authors derive the complexity for information set decoding used in channels where errors may occur in bursts, and to quantify the gain in complexity over the memoryless channel case.