Abstract
In this tutorial we introduce order domains and study the related codes. Special attention is given to the one-point geometric Goppa codes. We show how Gröbner basis theory helps us constructing order domains as well as helps us dealing with the related codes.
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
H. E. Andersen, On puncturing of codes from norm-trace curves, Finite Fields Appl. 13 (2007), no. 1, 136–157.
H. E. Andersen and O. Geil, Evaluation codes from order domain theory, Finite Fields Appl. 14 (2008), 92–123.
D. Augot, E. Betti and E. Orsini, An introduction to linear and cyclic codes, this volume, 2009, pp. 47–68.
P. Beelen, The order bound for general algebraic geometric codes, Finite Fields Appl. 13 (2007), no. 3, 655–680.
M. Bras-Amorós and M. E. O’Sullivan, The correction capability of the Berlekamp–Massey–Sakata algorithm with majority voting, AAECC 17 (2006), no. 5, 315–335.
B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, Ph.D. thesis, Innsbruck, 1965.
B. Buchberger, Gröbner-bases: An algorithmic method in polynomial ideal theory, Multidimensional systems theory, Reidel, Dordrecht, 1985, pp. 184–232.
B. Buchberger, Bruno Buchberger’s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal, J. Symb. Comput. 41 (2006), nos. 3–4, 475–511.
J. Fitzgerald and R. F. Lax, Decoding affine variety codes using Gröbner bases, Des. Codes Cryptogr. 13 (1998), no. 2, 147–158.
O. Geil, On codes from norm-trace curves, Finite Fields Appl. 9 (2003), 351–371.
O. Geil and T. Høholdt, On hyperbolic codes, LNCS, vol. 2227, Springer, Berlin, 2001, pp. 159–171.
O. Geil and R. Matsumoto, Generalized Sudan’s list decoding for order domain codes, Proc. of AAECC2007, 2007, pp. 50–59.
O. Geil and R. Pellikaan, On the structure of order domains, Finite Fields Appl. 8 (2002), 369–396.
O. Geil and C. Thommesen, On the Feng–Rao bound for generalized Hamming weights, LNCS, vol. 3857, Springer, Berlin, 2006, pp. 295–306.
P. Heijnen and R. Pellikaan, Generalized Hamming weights of q -ary Reed–Muller codes, IEEE Trans. on Inf. Th. 44 (1998), no. 1, 181–196.
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.
D. A. Leonard, A tutorial on AG code construction from a Gröbner basis perspective, this volume, 2009, pp. 93–106.
J. B. Little, The ubiquity of order domains for the construction of error control codes, Adv. Math. Commun. 1 (2007), no. 1, 151–171.
J. B. Little, Automorphisms and encoding of AG and order domain codes, this volume, 2009, pp. 107–120.
R. Matsumoto, Miura’s generalization of one-point AG codes is equivalent to Høholdt, van Lint and Pellikaan’s generalization, IEICE Trans. Fund. E82-A (1999), no. 10, 2007–2010.
M. E. O’Sullivan, New codes for the Berlekamp–Massey–Sakata algorithm, Finite Fields Appl. 7 (2001), no. 2, 293–317.
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.
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
Geil, O. (2009). Algebraic Geometry Codes from Order Domains. 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_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-93806-4_8
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)