From primary to dual affine variety codes over the Klein quartic
From MaRDI portal
Publication:2115735
DOI10.1007/S10623-021-00990-5zbMATH Open1492.94220arXiv2107.08955OpenAlexW3185186213WikidataQ114849828 ScholiaQ114849828MaRDI QIDQ2115735FDOQ2115735
Authors: Olav Geil 
Publication date: 21 March 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Abstract: In [17] 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 [23][Ex. 3.2, Ex. 4.1]. In the present work we translate the method from [17] 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 [23]. Combining then our knowledge on both primary and dual codes we determine asymmetric quantum codes with desirable parameters.
Full work available at URL: https://arxiv.org/abs/2107.08955
Recommendations
- On affine variety codes from the Klein quartic
- Bounding the minimum distance of affine variety codes using symbolic computations of footprints
- Affine variety codes over a hyperelliptic curve
- On the distance of stabilizer quantum codes from \(J\)-affine variety codes
- An improvement of the Feng-Rao bound for primary codes
Cites Work
- Asymmetric quantum codes: constructions, bounds and performance
- Title not available (Why is that?)
- Decoding affine variety codes using Gröbner bases
- The order bound for general algebraic geometric codes
- Feng-Rao decoding of primary codes
- Decoding algebraic-geometric codes up to the designed minimum distance
- Title not available (Why is that?)
- Distance bounds for algebraic geometric codes
- Coset bounds for algebraic geometric codes
- An improvement of the Feng-Rao bound for primary codes
- An improvement of the Feng-Rao bound on minimum distance
- Further improvements on the Feng-Rao bound for dual codes
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- Improved geometric Goppa codes. I. Basic theory
- Evaluation codes from an affine variety code perspective
- An Extension of the Order Bound for AG Codes
- Xing-Ling codes, duals of their subcodes, and good asymmetric quantum codes
- Generalized Hamming weights of affine Cartesian codes
- Quantum error-control codes
- High dimensional affine codes whose square has a designed minimum distance
- Construction of improved geometric Goppa codes from Klein curves and Klein-like curves
- On evaluation codes coming from a tower of function fields
- Two Gilbert-Varshamov-type existential bounds for asymmetric quantum error-correcting codes
- On affine variety codes from the Klein quartic
- Affine variety codes over a hyperelliptic curve
- The dual of an evaluation code
Cited In (6)
- On affine variety codes from the Klein quartic
- On the distance of stabilizer quantum codes from \(J\)-affine variety codes
- Affine variety codes over a hyperelliptic curve
- Title not available (Why is that?)
- Bounding the minimum distance of affine variety codes using symbolic computations of footprints
- Quaternary affine variety codes over a Klein-like curve
Uses Software
This page was built for publication: From primary to dual affine variety codes over the Klein quartic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115735)
