Abstract
This chapter presents material about syndrome decoding and list decoding of AG codes. The syndrome decoding of AG codes is viewed in terms of Sakata’s generalization of the Berlekamp–Massey algorithm and Feng and Rao’s majority voting scheme. Their list-decoding is viewed following Sudan’s ideas and some variations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Augot and L. Pecquet, A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed–Solomon codes, IEEE Trans. on Inf. Th. 46 (2000), no. 7, 2605–2614.
D. Augot and M. Stepanov, A note on the generalisation of the Guruswami–Sudan list decoding algorithm to Reed–Muller codes, this volume, 2009, pp. 359–398.
P. Beelen and K. Brander, Decoding folded Reed–Solomon codes using Hensel lifting, this volume, 2009, pp. 389–394.
W. Bosma, J. Cannon, and C. Playoust, The MAGMA algebra system. the user language, J. Symbolic Comput. 24 (1997), nos. 3–4, 235–265.
B. Buchberger, Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems, Aequationes Math. 4 (1970), 374–383.
B. Buchberger, Gröbner-bases: An algorithmic method in polynomial ideal theory, Multidimensional systems theory, Reidel, Dordrecht, 1985, pp. 184–232.
B. Buchberger, An algorithmical criterion for the solvability of algebraic systems of equations, London Math. Soc. LNS 251 (1998), 535–545.
J. Cannon and C. Playoust, MAGMA: a new computer algebra system, Euromath Bull. 2 (1996), no. 1, 113–144.
G. L. Feng and T. R. N. Rao, Decoding algebraic-geometric codes up to the designed minimum distance, IEEE Trans. on Inf. Th. 39 (1993), no. 1, 37–45.
O. Geil, Algebraic geometry codes from order domains, this volume, 2009, pp. 121–141.
E. Guerrini and A. Rimoldi, FGLM-like decoding: from Fitzpatrick’s approach to recent developments, this volume, 2009, pp. 197–218.
T. Høholdt and R. R. Nielsen, Decoding Hermitian codes with Sudan’s algorithm, LNCS, vol. 1719, Springer, Berlin, 1999, pp. 260–270.
T. Høholdt, J. H. van Lint, and R. Pellikaan, Algebraic geometry of codes, Handbook of coding theory, vols. I, II (V. S. Pless and W.C. Huffman, eds.), North-Holland, Amsterdam, 1998, pp. 871–961.
D. A. Leonard, Error-locator ideals for algebraic-geometric codes, IEEE Trans. on Inf. Th. 41 (1995), no. 3, 819–824.
D. A. Leonard, A tutorial on AG code construction from a Gröbner basis perspective, this volume, 2009, pp. 93–106.
MAGMA, J. J. Cannon, W. Bosma (eds.), Handbook of MAGMA functions, edition 2.15, 2008.
T. Mora, Gröbner technology, this volume, 2009, pp. 11–25.
R. Roth and G. Ruckenstein, Efficient decoding of Reed–Solomon codes beyond half the minimum distance, IEEE Trans. on Inf. Th. 46 (2000), 246–257.
S. Sakata, The BMS algorithm, this volume, 2009a, pp. 143–163.
S. Sakata, The BMS algorithm and decoding of AG codes, this volume, 2009b, pp. 165–185.
X. W. Wu and P. H. Siegel, Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes, IEEE Trans. on Inf. Th. 47 (2001), no. 6, 2579–2587.
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
Leonard, D.A. (2009). A Tutorial on AG Code Decoding from a Gröbner Basis Perspective. 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-93806-4_11
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)