zbMATH — the first resource for mathematics

On puncturing of codes from norm-trace curves. (English) Zbl 1172.94010
Summary: Constructing new codes from existing ones by puncturing is in this paper viewed in the context of order domains \(R\) where puncturing can be seen as redefinition of the evaluation map \(\varphi : R\to\mathbb F_q^n\). The order domains considered here are of the form \(R=\mathbb F[x_1, x_2,\dots, x_m]/I\) where redefining \(\varphi\) can be done by adding one or more polynomials to the basis of the defining ideal \(I\) to form a new ideal \(J\) in such a way that the number of points in the variety \(\mathbb V(I)\) is reduced by \(t\) to form \(\mathbb V(J)\) and puncturing in \(t\) coordinates is achieved. An explicit construction of such polynomials is given in the case of codes defined by norm-trace curves and examples are given of both evaluation codes and dual codes. Finally, it is demonstrated that the improvement in minimum distance can be significant when compared to the lower bound obtained by ordinary puncturing.

94B05 Linear codes, general
14G50 Applications to coding theory and cryptography of arithmetic geometry
Full Text: DOI
[1] H. Andersen, O. Geil, The missing evaluation codes from order domain theory, submitted for publication, preprint available at: .
[2] Cox, D.; Little, J.; O’Shea, D., Ideals varieties and algorithms—an introduction to computational algebraic geometry and commutative algebra, (1997), Springer New York
[3] Cox, D.; Little, J.; O’Shea, D., Using algebraic geometry, (1998), Springer New York · Zbl 0920.13026
[4] Feng, G.L.; Rao, T.R.N., A simple approach for construction of algebraic – geometric codes from affine plane curves, IEEE trans. inform. theory, 40, 4, 1003-1012, (1994) · Zbl 0814.94027
[5] Feng, G.-L.; Rao, T.R.N., Improved geometric Goppa codes. I. basic theory, IEEE trans. inform. theory, 41, 6, part 1, 1678-1693, (1995), (special issue on algebraic geometry codes) · Zbl 0866.94025
[6] Fitzgerald, J.; Lax, R.F., Decoding affine variety codes using Gröbner bases, Designs, codes cryptography, 13, 2, 147-158, (1998) · Zbl 0905.94027
[7] Geil, O., On codes from norm – trace curves, Finite fields appl., 9, 3, 351-371, (2003) · Zbl 1032.94015
[8] Geil, O.; Pellikaan, R., On the structure of order domains, Finite fields appl., 8, 369-396, (2002) · Zbl 1008.13007
[9] Høholdt, T.; van Lint, J.H.; Pellikaan, R., Order functions and evaluation codes, (), 138-150 · Zbl 1043.94544
[10] Høholdt, T.; van Lint, J.; Pellikaan, R., Algebraic geometry codes, (), (Chapter 10) · Zbl 0978.94046
[11] Lidl, R.; Niederreiter, H., Introduction to finite fields and their applications, (1986), Cambridge University Press Cambridge · Zbl 0629.12016
[12] MacWilliams, F.; Sloane, N., The theory of error-correcting codes, (1977), North-Holland Amsterdam · Zbl 0369.94008
[13] Matsumoto, R., Miura’s generalization of one-point AG codes is equivalent to Høholdt, Van lint and Pellikaan’s generalization, IEICE trans. fund., E82-A, 10, 2007-2010, (1999)
[14] Matsumoto, R.; Miura, S., On construction and generalization of algebraic geometry codes, (), 3-15
[15] R. Matsumoto, The \(C_{\mathit{ab}}\) Curve, Available at: .
[16] Miura, S., Algebraic geometric codes on certain plane curves, IEICE trans., J75-A, 11, 1735-1745, (1992), (in Japanese)
[17] S. Miura, Ph.D. Thesis, University of Tokyo, May 1997 (in Japanese).
[18] Miura, S., Linear codes on affine algebraic curves, IEICE trans., J81-A, 10, 1398-1421, (1998), (in Japanese)
[19] S. Miura, N. Kamiya, On the minimum distance of codes from some maximal curves, Technical Report IT92-147, IEICE, March 1993 (in Japanese).
[20] Munuera, C.; Ramirez, D., The second and third generalized Hamming weights of Hermitian codes, IEEE trans. inform. theory, 45, 2, 709-712, (1999) · Zbl 0945.94019
[21] Pellikaan, R., On the existence of order functions, J. statist. plann. inference, 94, 287-301, (2001) · Zbl 0981.94055
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.