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 variables. When our codes are MDS, and when and our lower bound for the minimum distance is 3, the codes are at least Hermitian almost MDS. For an infinite family of parameters, when 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.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC10907496 | PMC |
http://dx.doi.org/10.1007/s11128-024-04297-x | DOI Listing |
Quantum Inf Process
March 2024
School of Mathematics and Statistics, University College Dublin, Dublin, Ireland.
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 variables.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!