Abstract
In this short note we show how one can decode linear error-correcting codes up to half the minimum distance via solving a system of polynomial equations over a finite field. We also explicitly present the reduced Gröbner basis for the system considered.
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
D. Augot, Description of the minimum weight codewords of cyclic codes by algebraic system, Finite Fields Appl. (1996), no. 2, 138–152.
D. Augot, M. Bardet, and J.-C. Faugère, On the decoding of cyclic codes with Newton identities, Special Issue “Gröbner Bases Techniques in Cryptography and Coding Theory” of J. Symb. Comput., 2009.
S. Bulygin and R. Pellikaan, Bounded decoding of linear error-correcting codes with Gröbner bases, Special Issue “Gröbner Bases Techniques in Cryptography and Coding Theory” of J. Symb. Comput., to appear, 2009.
X. Chen, I. S. Reed, T. Helleseth, and K. Truong, General principles for the algebraic decoding of cyclic codes, IEEE Trans. on Inf. Th. 40 (1994a), 1661–1663.
X. Chen, I. S. Reed, T. Helleseth, and T. K. Truong, Algebraic decoding of cyclic codes: a polynomial ideal point of view, Finite fields, Contemp. Math., vol. 168, Am. Math. Soc., Providence, 1994b, pp. 15–22.
G.-M. Greuel, G. Pfister, and H. Schönemann, Singular 3.0. A computer algebra system for polynomial computations, http://www.singular.uni-kl.de, 2007, Centre for Computer Algebra, University of Kaiserslautern.
T. Høholdt, J. van Lint, and R. Pellikaan, Algebraic geometry of codes, Handbook of Coding Theory (V. S. Pless and W.C. Huffman, eds.), Elsevier, Amsterdam, 1998, pp. 871–961.
T. Mora and E. Orsini, Decoding cyclic codes: the Cooper philosophy, this volume, 2009, pp. 69–91.
E. Orsini and M. Sala, Correcting errors and erasures via the syndrome variety, J. Pure Appl. Algebra 200 (2005), 191–226.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bulygin, S., Pellikaan, R. (2009). Decoding Linear Error-Correcting Codes up to Half the Minimum Distance with Gröbner Bases. In: Sala, M., Sakata, S., Mora, T., Traverso, C., Perret, L. (eds) Gröbner Bases, Coding, and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93806-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-93806-4_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93805-7
Online ISBN: 978-3-540-93806-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)