Title :
Burst List Decoding of Interleaved Reed–Solomon Codes
Author :
Kolan, Tom ; Roth, Ron M.
Author_Institution :
Comput. Sci. Dept., Technion - Israel Inst. of Technol., Haifa, Israel
Abstract :
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.
Keywords :
Reed-Solomon codes; decoding; interleaved codes; burst errors; burst list decoding algorithm; generalized Reiger bound; interleaved Reed-Solomon codes; Arrays; Complexity theory; Decoding; Indexes; Linear codes; Polynomials; Redundancy; Burst errors; Reed–Solomon codes; Reiger bound; interleaving; list decoding;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2013.2287477
