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/PMC10907496PMC
http://dx.doi.org/10.1007/s11128-024-04297-xDOI Listing

Publication Analysis

Top Keywords

generalized monomial-cartesian
12
monomial-cartesian codes
12
codes
9
hermitian mds
8
codes generalized
8
minimum distance
8
mds
4
mds hermitian
4
mds gilbert-varshamov
4
gilbert-varshamov quantum
4

Similar Publications

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 PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!