Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Reconstructing curves in three (and higher) dimensional space from noisy data
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Decoding of interleaved Reed Solomon codes over noisy data
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
List decoding of algebraic-geometric codes
IEEE Transactions on Information Theory
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Collaborative decoding of interleaved Reed-Solomon codes and concatenated code designs
IEEE Transactions on Information Theory
A note on interleaved Reed-Solomon codes over Galois rings
IEEE Transactions on Information Theory
Designs, Codes and Cryptography
Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
Designs, Codes and Cryptography
Decoding interleaved Reed---Solomon codes beyond their joint error-correcting capability
Designs, Codes and Cryptography
| Hi-index | 0.12 |
We analyze a generalization of a recent algorithm of Bleichenbacher et al. for decoding interleaved codes on the Q-ary symmetric channel for large Q. We will show that for any m and any ε the new algorithms can decode up to a fraction of at least $\frac{\beta m}{\beta m+1}(1-R-2Q^{-1/2m}) - \epsilon$ errors, where $\beta = \frac{ln(q^m - 1)}{ln(q^m)}$, and that the error probability of the decoder is upper bounded by O(1/qεn), where n is the block-length. The codes we construct do not have a-priori any bound on their length.