Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
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.
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
B.K. Boguraev, Mary S. Neff
HICSS 2000
Rolf Clauberg
IBM J. Res. Dev
Reena Elangovan, Shubham Jain, et al.
ACM TODAES