From primary to dual affine variety codes over the Klein quartic
From MaRDI portal
Publication:2115735
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.
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
- scientific article; zbMATH DE number 1284423 (Why is no real title available?)
- scientific article; zbMATH DE number 493096 (Why is no real title available?)
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- Affine variety codes over a hyperelliptic curve
- An Extension of the Order Bound for AG Codes
- An improvement of the Feng-Rao bound for primary codes
- An improvement of the Feng-Rao bound on minimum distance
- Asymmetric quantum codes: constructions, bounds and performance
- Construction of improved geometric Goppa codes from Klein curves and Klein-like curves
- Coset bounds for algebraic geometric codes
- Decoding affine variety codes using Gröbner bases
- Decoding algebraic-geometric codes up to the designed minimum distance
- Distance bounds for algebraic geometric codes
- Evaluation codes from an affine variety code perspective
- Feng-Rao decoding of primary codes
- Further improvements on the Feng-Rao bound for dual codes
- Generalized Hamming weights of affine Cartesian codes
- High dimensional affine codes whose square has a designed minimum distance
- Improved geometric Goppa codes. I. Basic theory
- On affine variety codes from the Klein quartic
- On evaluation codes coming from a tower of function fields
- Quantum error-control codes
- The dual of an evaluation code
- The order bound for general algebraic geometric codes
- Two Gilbert-Varshamov-type existential bounds for asymmetric quantum error-correcting codes
- Xing-Ling codes, duals of their subcodes, and good asymmetric quantum codes
Cited in
(6)- On affine variety codes from the Klein quartic
- scientific article; zbMATH DE number 5016664 (Why is no real title available?)
- Affine variety codes over a hyperelliptic curve
- Quaternary affine variety codes over a Klein-like curve
- Bounding the minimum distance of affine variety codes using symbolic computations of footprints
- On the distance of stabilizer quantum codes from \(J\)-affine variety codes
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)
