Abstract
We study a family of primary affine variety codes defined from the Klein quartic. The duals of these codes have previously been treated in Kolluru et al., (Appl. Algebra Engrg. Comm. Comput. 10(6):433–464, 2000, Ex. 3.2). Among the codes that we construct almost all have parameters as good as the best known codes according to Grassl (2007) and in the remaining few cases the parameters are almost as good. To establish the code parameters we apply the footprint bound (Geil and Høholdt, IEEE Trans. Inform. Theory 46(2), 635–641, 2000 and Høholdt 1998) from Gröbner basis theory and for this purpose we develop a new method where we inspired by Buchberger’s algorithm perform a series of symbolic computations.
Similar content being viewed by others
References
Cox, D.A., Little, J., O’Shea, D.: Ideals, varieties, and algorithms: An introduction to computational algebraic geometry and commutative algebra, volume Fourth Edition. Springer, Berlin (2015)
Feng, G.L., Rao, T.R.N.: Decoding algebraic-geometric codes up to the designed minimum distance. IEEE Trans. Inform. Theory 39(1), 37–45 (1993)
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)
Feng, G.L., Rao, T.R.N.: Improved geometric Goppa codes part I: Basic theory. IEEE Trans. Inform. Theory 41(6), 1678–1693 (1995)
Fitzgerald, J., Lax, R.F.: Decoding affine variety codes using Gröbner bases. Des. Codes Cryptogr. 13(2), 147–158 (1998)
Geil, O.: Evaluation codes from an affine variety code perspective. In: Martínez-Moro, E., Munuera, C., Ruano, D. (eds.) Advances in algebraic geometry codes, volume 5 of Coding Theory and Cryptology, pages 153–180. World Scientific, Singapore (2008)
Geil, O., Høholdt, T.: Footprints or generalized Bezout’s theorem. IEEE Trans. Inform. Theory 46(2), 635–641 (2000)
Geil, O., Martin, S.: An improvement of the Feng-Rao bound for primary codes. Des. Codes Crypt. 76(1), 49–79 (2015)
Geil, O., Özbudak, F.: Bounding the minimum distance of affine variety codes using symbollic computations of footprints. In: Barbero, A.I., Skachek, V., Ytrehus, Ø. (eds.) Coding Theory and Applications, Proceedings of 5th International Castle Meeting, ICMCTA 2017. Vihula, Estonia, Aug. 28–31, 2017, volume 10495 of Lecture Notes in Comput. Sci., pages 128–138. Springer (2017)
Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at. Accessed on 2017-05-20 (2007). http://www.codetables.de
Hansen, J.P.: Codes on the Klein Quartic, ideals and decoding. IEEE Trans. Inform. Theory 33(6), 923–925 (1987)
Høholdt, T.: On (or in) Dick Blahut’s’ footprint’. Codes, Curves and Signals, pages 3–9 (1998)
Høholdt, T., van Lint, J.H., Pellikaan, R.: Algebraic geometry codes. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, volume 1, pages 871–961. Elsevier, Amsterdam (1998)
Kolluru, M.S., Feng, G.L., Rao, T.R.N.: Construction of improved geometric Goppa codes from Klein curves and Klein-like curves. Appl. Algebra Engrg. Comm. Comput. 10(6), 433–464 (2000)
Pellikaan, R.: The Klein quartic, the Fano plane and curves representing designs. In: Codes, Curves, and Signals, pages 9–20. Springer (1998)
Salazar, G., Dunn, D., Graham, S.B.: An improvement of the Feng-Rao bound on minimum distance. Finite Fields Appl. 12, 313–335 (2006)
Acknowledgements
The authors are grateful to Department of Mathematical Sciences, Aalborg University for supporting a one-month visiting professor position for the second listed author.
Author information
Authors and Affiliations
Corresponding author
Additional information
This article is part of the Topical Collection on Special Issue on Coding Theory and Applications
Supported from The Danish Council for Independent Research (Grant No. DFF–4002-00367), METU Coordinatorship of Scientific Research Projects via grant for projects BAP-01-01-2016-008 and BAP-07-05-2017-007.
Rights and permissions
About this article
Cite this article
Geil, O., Özbudak, F. On affine variety codes from the Klein quartic. Cryptogr. Commun. 11, 237–257 (2019). https://doi.org/10.1007/s12095-018-0285-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-018-0285-6