Stabilizer quantum codes from J-affine variety codes and a new Steane-like enlargement

@article{Galindo2015StabilizerQC,
  title={Stabilizer quantum codes from J-affine variety codes and a new Steane-like enlargement},
  author={Carlos Galindo and Fernando Hernando and Diego Ruano},
  journal={Quantum Information Processing},
  year={2015},
  volume={14},
  pages={3211-3231}
}
New stabilizer codes with parameters better than the ones available in the literature are provided in this work, in particular quantum codes with parameters $$[[127,63, {\ge }12]]_2$$[[127,63,≥12]]2 and $$[[63,45, {\ge }6]]_4$$[[63,45,≥6]]4 that are records. 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… 
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.
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.
On Steane-enlargement of quantum codes from Cartesian product point sets
TLDR
This work gives bounds on the dimension increase obtained via enlargement, and additionally gives an algorithm to compute the true increase, and compares with the Gilbert–Varshamov bound for stabilizer quantum codes shows that several of the enlarged codes match or exceed the parameters promised by the bound.
Steane-enlargement of quantum codes from the Hermitian function field
TLDR
This paper contains two constructions of quantum codes whose parameters are described by explicit formulae, and it is shown that these codes compare favourably to existing, comparable constructions in the literature.
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
Entanglement-Assisted Quantum Error Correcting Codes From RS Codes and BCH Codes with Extension Degree 2
TLDR
The main task in this work is the computation of a completely general formula for the minimum number of required maximally entangled quantum states.
Aalborg Universitet New binary and ternary LCD codes
TLDR
Binary and ternary LCD codes constructed as subfieldsubcodes of J-affine variety codes of BCH codes are described and some new and good LCD codes coming from this construction are provided.
Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes
  • N. Patanker, S. Singh
  • Mathematics, Computer Science
    Advances in Mathematics of Communications
  • 2021
TLDR
An upper bound on the number of zeroes in the affine torus of any set of $r$ linearly independent square-free polynomials over $\mathbb{F}_{q}$ in $s$ variables is determined.
O ct 2 01 7 NEW BINARY AND TERNARY LCD CODES
TLDR
Binary and ternary LCD codes constructed as subfield-subcodes of J-affine variety codes of BCH codes are described and some new and good LCD codes coming from this construction are provided.
Optimal $(r,\delta)$-LRCs from zero-dimensional affine variety codes and their subfield-subcodes
TLDR
Zero-dimensional variety codes (ZAVCs) are introduced which can be regarded as ( r , δ )-locally recoverable codes (LRCs) and those giving rise to ( r, δ)-optimal LRCs for that distance are determined.
...
...

References

SHOWING 1-10 OF 68 REFERENCES
Enlargement of Calderbank-Shor-Steane quantum codes
  • A. Steane
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1999
It is shown that a classical error correcting code C=[n,k,d] which contains its dual, C/sup /spl perp///spl sube/C, and which can be enlarged to C'=[n,k'>k+1,d'], can be converted into a quantum code
On Quantum and Classical BCH Codes
TLDR
It is shown that a BCH code of length n can contain its dual code only if its designed distance delta=O(radicn), and the converse is proved in the case of narrow-sense codes.
Nonbinary Stabilizer Codes Over Finite Fields
TLDR
The basic theory of stabilizer codes over finite fields is described and a Galois theory for these objects is introduced, which generalizes the well-known notion of additive codes over F4 of the binary case.
Constructions of new families of nonbinary quantum codes
TLDR
Three code constructions generating new families of good nonbinary quantum codes are presented in this paper and have parameters better than the ones available in the literature.
Constructions of new families of nonbinary CSS codes
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.
On optimal quantum codes
TLDR
This work presents families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal, and shows that codes with parameters 〚n, n - 2d + 2, d〛q exist for all 3≦n≤q and 1≤d≤n/2+1.
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.
Constructing Quantum Error-Correcting Codes for pm-State System from Classical Error-Correcting Codes
TLDR
This paper proposes a construction of quantum error-correcting codes for p-state systems from classical error-Correcting codes which is a generalization of [3], where p denotes a prime number andm a positive integer.
...
...