Abstract
We present an efficient implementation of Sudan’s algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q-polynomial, and a reduction of the problem of factoring the Q-polynomial
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
Madhu Sudan: “Decoding of Reed Solomon Codes beyond the Error-Correction Bound” Journal of Complexity 13, 180–193, 1997.
M.A. Shokrollahi and H. Wassermann: “List Decoding of Algebraic-Geometric Codes” IEEE Trans. Inform. Theory, vol 45, pp. 432–437, March 1999.
Venkatesan Guruswami and Madhu Sudan: “Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes” Proc. 39th IEEE Symp. Foundations Comput. Sci., 1998.
Rudolf Lidl and Harald Niederreiter: “Finite fields” Addison-Wesley,1983.
Henning Stichtenoth: “Algebraic function fields and codes” Springer-Verlag,1993.
Weishi Feng and R. E. Blahut: “Some Results on the Sudan Algorithm”, Proceedings 1998 IEEE International Symposium on Information Theory, p.57, august 1998.
Ralf Kötter: “On Algebraic Decoding of Algebraic-Geometric and Cyclic Codes” Department of Electrical Engineering, Linköping University, 1996.
G.-L. Feng and K. K. Tzeng: “A Generalization of the Berlekamp-Massey Algorithm for Multisequence Shift-Register Synthesis with Applications to Decoding Cyclic Codes”,IEEE Trans. Inform. Theory, vol. 37, pp. 1274–1287, Sept. 1991.
H. Elbr∅nd Jensen, R. Refslund Nielsen, and T. H∅holdt: “Performance analysis of a decoding algorithm for algebraic geometry codes” IEEE Trans. on Inform. Theory, vol.45,pp.1712–1717,July 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Høholdt, T., Nielsen, R.R. (1999). Decoding Hermitian Codes with Sudan’s Algorithm. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_26
Download citation
DOI: https://doi.org/10.1007/3-540-46796-3_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66723-0
Online ISBN: 978-3-540-46796-0
eBook Packages: Springer Book Archive