Stabilizer quantum codes defined by trace-depending polynomials

08/12/2022
by   Carlos Galindo, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2023

Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed-Solomon codes

Subfield subcodes of Reed-Solomon codes and their duals, BCH codes, have...
research
12/22/2020

A generalization of the construction of quantum codes from Hermitian self-orthogonal codes

An important strength of the q-ary stabilizer quantum codes is that they...
research
09/05/2023

Quaternary Conjucyclic Codes with an Application to EAQEC Codes

Conjucyclic codes are part of a family of codes that includes cyclic, co...
research
07/28/2023

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

We construct new stabilizer quantum error-correcting codes from generali...
research
08/08/2021

A Database of Quantum Codes

Quantum error correcting codes (QECC) is becoming an increasingly import...
research
12/06/2022

New Quantum codes from constacyclic codes over a general non-chain ring

Let q be a prime power and let ℛ=𝔽_q[u_1,u_2, ⋯, u_k]/⟨ f_i(u_i),u_iu_j-...
research
08/05/2021

The Key Equation for One-Point Codes

For Reed-Solomon codes, the key equation relates the syndrome polynomial...

Please sign up or login with your details

Forgot password? Click here to reset