Stabilizer quantum codes defined by trace-depending polynomials

DOI10.1016/J.FFA.2022.102138MaRDI QIDQ6407678arXivFDO

Authors Carlos Galindo, Fernando Hernando, Helena Martín-Cruz, Diego Ruano

Publication date 12 August 2022

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.FFA.2022.102138

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Quantum coding (general) (81P70) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

arXiv classification

cs.ITmath.IT

Abstract: Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace. In this paper, we propose to evaluate polynomials at the roots of trace-depending polynomials (given by a constant plus the trace of a polynomial) and show that this procedure gives rise to stabilizer quantum error-correcting codes with a wider range of lengths than in other papers involving roots of the trace and with excellent parameters. Namely, we are able to provide new binary records and non-binary codes improving the ones available in the literature.

This page was built for publication: Stabilizer quantum codes defined by trace-depending polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407678)