Abstract
In Geil and Özbudak (Cryptogr Commun 11(2):237–257, 2019) a novel method was established to estimate the minimum distance of primary affine variety codes and a thorough treatment of the Klein quartic led to the discovery of a family of primary codes with good parameters, the duals of which were originally treated in Kolluru et al (Appl Algebra Eng Commun Comput 10(6):433-464, 2000)[Ex. 3.2, Ex. 4.1]. In the present work we translate the method from Geil and Özbudak (Cryptogr Commun 11(2):237–257, 2019) into a method for also dealing with dual codes and we demonstrate that for the considered family of dual affine variety codes from the Klein quartic our method produces much more accurate information than what was found in Kolluru et al (Appl Algebra Eng Commun Comput 10(6):433-464, 2000). Combining then our knowledge on both primary and dual codes we determine asymmetric quantum codes with desirable parameters.
Original language | English |
---|---|
Journal | Designs, Codes, and Cryptography |
Volume | 90 |
Issue number | 3 |
Pages (from-to) | 523-543 |
Number of pages | 21 |
ISSN | 0925-1022 |
DOIs | |
Publication status | Published - Mar 2022 |
Bibliographical note
Publisher Copyright:© 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- Affine variety code
- Asymmetric quantum code
- Feng–Rao bound
- Gröbner basis
- Klein quartic