Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bleichenbacher, D., Kiyayias, A., Yung, M.: In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 97–108. Springer, Heidelberg (2003)
Brown, A., Minder, L., Shokrollahi, A.: Probabilistic decoding of interleaved Reed-Solomon-codes on the Q-ary symmetric channel. In: Proceedings of the IEEE International Symposium on Information Theory, p. 327 (2004)
Coppersmith, D., Sudan, M.: Reconstructing curves in three (and higher dimensional) space from noisy data. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC) (2003)
Garcia, A., Stichtenoth, H.: A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound. Invent. Math. 121, 211–222 (1995)
Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometric codes. In: Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, pp. 28–37 (1998)
Justesen, J., Thommesen, C., Høholdt, T.: Decoding of concatenated codes with interleaved outer codes. In: Proc. International Symposium on Information Theory, p. 328 (2004)
Katsman, G.L., Tsfasman, M.A., Vladut, S.G.: Modular curves and codes with a polynomial construction. IEEE Trans. Inform. Theory 30, 353–355 (1984)
Luby, M., Mitzenmacher, M.: Verification codes. In: Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing (2002)
Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman, D.: Efficient erasure correcting codes. IEEE Trans. Inform. Theory 47, 569–584 (2001)
Parvaresh, F., Vardy, A.: Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In: Proceedings of the 46th Annual IEEE Symposium on the Foundations of Computer Science, FOCS (2005), (to appear)
Shokrollahi, A., Wang, W.: LDPC codes with rates very close to the capacity of the q-ary symmetric channel for large q. In: Proceedings of the International Symposium on Information Theory, Chicago (2004)
Shokrollahi, A., Wasserman, H.: List decoding of algebraic-geometric codes. IEEE Trans. Inform. Theory 45, 432–437 (1999)
Sudan, M.: Decoding of Reed-Solomon codes beyond the error-correction bound. J. Compl. 13, 180–193 (1997)
Vardy, A.: Private communication (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brown, A., Minder, L., Shokrollahi, A. (2005). Improved Decoding of Interleaved AG Codes. In: Smart, N.P. (eds) Cryptography and Coding. Cryptography and Coding 2005. Lecture Notes in Computer Science, vol 3796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11586821_3
Download citation
DOI: https://doi.org/10.1007/11586821_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30276-6
Online ISBN: 978-3-540-32418-8
eBook Packages: Computer ScienceComputer Science (R0)