Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
HTML articles powered by AMS MathViewer
- by Venkatesan Guruswami and Anindya C. Patthak PDF
- Math. Comp. 77 (2008), 447-473
Abstract:
We define a new family of error-correcting codes based on algebraic curves over finite fields, and develop efficient list decoding algorithms for them. Our codes extend the class of algebraic-geometric (AG) codes via a (nonobvious) generalization of the approach in the recent breakthrough work of Parvaresh and Vardy (2005). Our work shows that the PV framework applies to fairly general settings by elucidating the key algebraic concepts underlying it. Also, more importantly, AG codes of arbitrary block length exist over fixed alphabets $\Sigma$, thus enabling us to establish new trade-offs between the list decoding radius and rate over a bounded alphabet size. The work of Parvaresh and Vardy (2005) was extended in Guruswami and Rudra (2006) to give explicit codes that achieve the list decoding capacity (optimal trade-off between rate and fraction of errors corrected) over large alphabets. A similar extension of this work along the lines of Guruswami and Rudra could have substantial impact. Indeed, it could give better trade-offs than currently known over a fixed alphabet (say, $\textrm {GF}(2^{12})$), which in turn, upon concatenation with a fixed, well-understood binary code, could take us closer to the list decoding capacity for binary codes. This may also be a promising way to address the significant complexity drawback of the result of Guruswami and Rudra, and to enable approaching capacity with bounded list size independent of the block length (the list size and decoding complexity in their work are both $n^{\Omega (1/\varepsilon )}$ where $\varepsilon$ is the distance to capacity). Similar to algorithms for AG codes from Guruswami and Sudan (1999) and (2001), our encoding/decoding algorithms run in polynomial time assuming a natural polynomial-size representation of the code. For codes based on a specific “optimal” algebraic curve, we also present an expected polynomial time algorithm to construct the requisite representation. This in turn fills an important void in the literature by presenting an efficient construction of the representation often assumed in the list decoding algorithms for AG codes.References
- Arnaldo García and Henning Stichtenoth, A tower of Artin-Schreier extensions of function fields attaining the Drinfel′d-Vlăduţ bound, Invent. Math. 121 (1995), no. 1, 211–222. MR 1345289, DOI 10.1007/BF01884295
- Arnaldo Garcia and Henning Stichtenoth, On the asymptotic behaviour of some towers of function fields over finite fields, J. Number Theory 61 (1996), no. 2, 248–273. MR 1423052, DOI 10.1006/jnth.1996.0147
- Venkatesan Guruswami and Piotr Indyk, Expander-based constructions of efficiently decodable codes (extended abstract), 42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001) IEEE Computer Soc., Los Alamitos, CA, 2001, pp. 658–667. MR 1948755
- Venkatesan Guruswami and Atri Rudra, Explicit capacity-achieving list-decodable codes or decoding up to the Singleton bound using folded Reed-Solomon codes, STOC’06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 1–10. MR 2277125, DOI 10.1145/1132516.1132518
- Venkatesan Guruswami, Amit Sahai, and Madhu Sudan, “Soft-decision” decoding of Chinese remainder codes, 41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000) IEEE Comput. Soc. Press, Los Alamitos, CA, 2000, pp. 159–168. MR 1931814, DOI 10.1109/SFCS.2000.892076
- Venkatesan Guruswami and Madhu Sudan, Improved decoding of Reed-Solomon and algebraic-geometry codes, IEEE Trans. Inform. Theory 45 (1999), no. 6, 1757–1767. MR 1720630, DOI 10.1109/18.782097
- Venkatesan Guruswami and Madhu Sudan, On representations of algebraic-geometry codes, IEEE Trans. Inform. Theory 47 (2001), no. 4, 1610–1613. MR 1830110, DOI 10.1109/18.923745
- Ralf Koetter and Alexander Vardy, Soft decoding of Reed Solomon codes and optimal weight assignments, ITG Fachtagung (Berlin, Germany), January 2002.
- Ralf Koetter and Alexander Vardy, Algebraic soft-decision decoding of Reed-Solomon codes, IEEE Trans. Inform. Theory 49 (2003), no. 11, 2809–2825. MR 2027561, DOI 10.1109/TIT.2003.819332
- Rudolf Lidl and Harald Niederreiter, Introduction to finite fields and their applications, Cambridge University Press, Cambridge, 1986. MR 860948
- Farzad Parvaresh and Alexander Vardy, Correcting errors beyond the Guruswami-Sudan radius in polynomial time, Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS), 2005, pp. 285–294.
- Kenneth W. Shum, Ilia Aleshnikov, P. Vijay Kumar, Henning Stichtenoth, and Vinay Deolaikar, A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound, IEEE Trans. Inform. Theory 47 (2001), no. 6, 2225–2241. MR 1873198, DOI 10.1109/18.945244
- Henning Stichtenoth, Algebraic function fields and codes, Universitext, Springer-Verlag, Berlin, 1993. MR 1251961
- Madhu Sudan, Decoding of Reed Solomon codes beyond the error-correction bound, J. Complexity 13 (1997), no. 1, 180–193. MR 1449766, DOI 10.1006/jcom.1997.0439
- M. A. Tsfasman, S. G. Vlăduţ, and Th. Zink, Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound, Math. Nachr. 109 (1982), 21–28. MR 705893, DOI 10.1002/mana.19821090103
Additional Information
- Venkatesan Guruswami
- Affiliation: Department of Computer Science & Engineering, University of Washington, Seattle, Washington 98195
- Email: venkat@cs.washington.edu
- Anindya C. Patthak
- Affiliation: Department of Computer Science, University of Texas at Austin, Austin, Texas 78712
- Email: anindya@cs.utexas.edu
- Received by editor(s): July 26, 2006
- Received by editor(s) in revised form: November 14, 2006
- Published electronically: September 13, 2007
- Additional Notes: An extended abstract describing some of these results was presented at the 47th Annual Symposium on Foundations of Computer Science (FOCS), 2006. This is an expanded version of the paper, containing the proofs and algorithms in full
The first author was supported by NSF Career Award CCF-0343672, an Alfred P. Sloan Research Fellowship, and a David and Lucile Packard Foundation Fellowship
The second author was supported in part by NSF Grant CCR-0310960 - © Copyright 2007 Venkatesan Guruswami and Anindya C. Patthak
- Journal: Math. Comp. 77 (2008), 447-473
- MSC (2000): Primary 94B27, 12Y05, 14Q05, 14H05
- DOI: https://doi.org/10.1090/S0025-5718-07-02012-1
- MathSciNet review: 2353961