Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
It is shown that interleaved Reed-Solomon codes can be list-decoded for burst errors while attaining the generalized Reiger bound for list decoding. A respective decoding algorithm is presented that is (significantly) more efficient than a burst list decoder for a noninterleaved Reed-Solomon code with comparable parameters. Finally, it is shown through counterexamples that unlike the special case of Reed-Solomon codes, interleaving does not always preserve the list decoding properties of the constituent code. © 1963-2012 IEEE.
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976