Abstract
We generalize Sudan’s list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the proposed method is larger than the original list decoding without multiplicity.
This research is in part supported by the Danish National Science Research Council Grant FNV-21040368 and the MEXT 21st Century COE Program: Photonics Nanodevice Integration Engineering.
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.
Similar content being viewed by others
References
Andersen, H.E., Geil, O.: Evaluation Codes From Order Domain Theory. Finite Fields and Their Appl. (2007) doi:10.1016/j.ffa.2006.12.004
Augot, D., Stepanov, M.: Decoding Reed-Muller Codes with the Guruswami-Sudan’s Algorithm. In: Slides of Talk Given by D. Augot at Workshop D1 Special Semester on Gröbner Bases and Related Methods, RICAM, Linz (2006), http://www.ricam.oeaw.ac.at/specsem/srs/groeb/download/Augot.pdf
Geil, O., Pellikaan, R.: On the Structure of Order Domains. Finite Fields and Their Appl. 8, 369–396 (2002)
Geil, O.: On Codes From Norm-Trace Curves. Finite Fields and Their Appl. 9, 351–371 (2003)
Guruswami, V., Sudan, M.: Improved Decoding of Reed-Solomon and Algebraic-Geometry Codes. IEEE Trans. Inform. Theory 45(4), 1757–1767 (1999)
Høholdt, T., van Lint, J., Pellikaan, R.: Algebraic Geometry Codes. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, pp. 871–961. Elsevier, Amsterdam (1998)
O’Sullivan, M.E.: New Codes for the Berlekamp-Massey-Sakata Algorithm. Finite Fields and Their Appl. 7, 293–317 (2001)
Pellikaan, R., Wu, X.-W.: List Decoding of q-ary Reed-Muller Codes. IEEE Trans. Inform. Theory 50, 679–682 (2004)
Shokrollahi, M.A., Wasserman, H.: List Decoding of Algebraic-Geometric Codes. IEEE Trans. Inform. Theory 45(2), 432–437 (1999)
Sudan, M.: Decoding of Reed Solomon Codes Beyond the Error Correction Bound. J. Complexity 13, 180–193 (1997)
Wu, X.-W.: An Algorithm for Finding the Roots of the Polynomials Over Order Domains. In: 2002 IEEE International Symposium on Information Theory, p. 202. IEEE Press, New York (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geil, O., Matsumoto, R. (2007). Generalized Sudan’s List Decoding for Order Domain Codes. In: Boztaş, S., Lu, HF.(. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2007. Lecture Notes in Computer Science, vol 4851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77224-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-77224-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77223-1
Online ISBN: 978-3-540-77224-8
eBook Packages: Computer ScienceComputer Science (R0)