English

MDS, Hermitian Almost MDS, and Gilbert-Varshamov Quantum Codes from Generalized Monomial-Cartesian Codes

Information Theory 2024-10-25 v1 math.IT

Abstract

We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized monomial-Cartesian codes arise from polynomials in mm variables. When m=1m=1 our codes are MDS, and when m=2m=2 and our lower bound for the minimum distance is 33 the codes are at least Hermitian Almost MDS. For an infinite family of parameters when m=2m=2 we prove that our codes beat the Gilbert-Varshamov bound. We also present many examples of our codes that are better than any known code in the literature.

Keywords

Cite

@article{arxiv.2307.15488,
  title  = {MDS, Hermitian Almost MDS, and Gilbert-Varshamov Quantum Codes from Generalized Monomial-Cartesian Codes},
  author = {Beatriz Barbero-Lucas and Fernando Hernando and Helena Martín-Cruz and Gary McGuire},
  journal= {arXiv preprint arXiv:2307.15488},
  year   = {2024}
}
R2 v1 2026-06-28T11:42:47.537Z