Quantum codes from affine variety codes and their subfield-subcodes

@article{Galindo2015QuantumCF,
  title={Quantum codes from affine variety codes and their subfield-subcodes},
  author={Carlos Galindo and Fernando Hernando},
  journal={Designs, Codes and Cryptography},
  year={2015},
  volume={76},
  pages={89-100}
}
We use affine variety codes and their subfield-subcodes to obtain quantum stabilizer codes via the CSS code construction. With this procedure we get codes with good parameters, some of them exceeding the CSS quantum Gilbert–Varshamov bound given by Feng and Ma. 
On the distance of stabilizer quantum codes from J-affine variety codes
TLDR
This work shows how to derive quantum stabilizer codes with designed minimum distance from J-affine variety codes and their subfield-subcodes, which allows to obtain new quantum codes, some of them either with better parameters, or with larger distances than the previously known codes.
QUANTUM CODES FROM ALGEBRAIC GEOMETRY CODES OF CASTLE TYPE
TLDR
Algebraic Geometry codes producing quantum error-correcting codes by the CSS construction are studied to systematize these constructions by showing the common theory that underlies all of them.
On the distance of stabilizer quantum codes given by $J$-affine variety codes
TLDR
This work shows how to derive quantum stabilizer codes with designed minimum distance from self-orthogonal $J$-affine variety codes and their subfield-subcodes and allows us to obtain new quantum codes, some of them either, with better parameters, or with larger distances than the previously known codes.
Quantum error-correcting codes from algebraic geometry codes of Castle type
TLDR
This work systematize these constructions of algebraic geometry codes producing quantum error-correcting codes by the CSS construction by showing the common theory that underlies all of them.
Locally recoverable J-affine variety codes
On certain self-orthogonal AG codes with applications to Quantum error-correcting codes
TLDR
A construction of quantum codes from self-orthogonal algebraic geometry codes is provided, based on the CSS construction as well as on some peculiar properties of the underlying algebraic curves, named Swiss curves.
N ov 2 01 9 LOCALLY RECOVERABLE J-AFFINE VARIETY CODES
We prove that subfield-subcodes over finite fields Fq of some J-affine variety codes provide locally recoverable codes correcting more than one erasure. We compute their (r, δ)-localities and show
Stabilizer quantum codes from J-affine variety codes and a new Steane-like enlargement
TLDR
These codes are constructed with a new generalization of the Steane’s enlargement procedure and by considering orthogonal subfield-subcodes—with respect to the Euclidean and Hermitian inner product—of a new family of linear codes, the J-affine variety codes.
Classical and Quantum Evaluation Codes at the Trace Roots
We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their
...
...

References

SHOWING 1-10 OF 50 REFERENCES
Nonbinary quantum stabilizer codes
TLDR
This work defines and shows how to construct nonbinary quantum stabilizer codes, a relationship between self-orthogonal codes over F(q/sup 2/) and q-ary quantum codes for any prime power q, based on nonbinary error bases.
Decoding Affine Variety Codes Using Gröbner Bases
TLDR
It is shown that one can, at least in theory, decode affine variety codes up to half the true minimum distance by using the theory of Gröbner bases.
Quantum twisted codes
TLDR
This work considers an obvious generalization of these quantum codes in the symplectic geometry setting and obtains general constructions using the theory of twisted BCH-codes (also known as Reed-Solomon subfield subcodes), leading to families of quantum codes with good parameters.
A finite Gilbert-Varshamov bound for pure stabilizer quantum codes
  • K. Feng, Zhi Ma
  • Computer Science
    IEEE Transactions on Information Theory
  • 2004
TLDR
From this quantum GV bound, several new binary quantum codes are obtained in a nonconstructive way having better parameters than the known codes.
Quantum Quasi-Cyclic LDPC Codes
  • M. Hagiwara, H. Imai
  • Computer Science
    2007 IEEE International Symposium on Information Theory
  • 2007
TLDR
A construction of a pair of quasi-cyclic LDPC codes to construct a quantum error-correcting code is proposed based on algebraic combinatorics and have lots of variations for length, code rate.
Asymptotic bounds on quantum codes from algebraic geometry codes
TLDR
A characterization of p-ary (p is a prime) quantum codes given by Feng and Xing is generalized and makes it possible to convert an asymptotic bound of Stichtenoth andXing for nonlinear algebraic geometry codes to a quantum asymPTotic bound.
Quantum Error Correction Via Codes Over GF
The problem of finding quantum-error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner
Subfield-subcodes of Generalized Toric codes
TLDR
This work identifies polynomial generators for subfield-subcodes of Generalized Toric (GT) codes which allows us to determine the dimensions and obtain bounds for the minimum distance.
On the structure of generalized toric codes
On the dimension of subfield subcodes
A new lower bound for the dimension of a subfield subcode is given. This bound improves the well-known lower bound of P. Delsarte (1975) and coincides in many cases with the true dimension of the
...
...