Classical and Quantum Evaluation Codes at the Trace Roots

Abstract

We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their subfield-subcodes with respect to the Hermitian inner product. They allow us to construct stabilizer quantum codes over several finite fields which substantially improve the codes in the literature and that are records at [http://www.codetables.de] for the binary case. Moreover, we obtain several classical linear codes over the field ${\mathbb{F}}_4$ which are records at [http://www.codetables.de].

References in corpus (1)

• Quantum generalized Reed-Solomon codes: Unified framework for quantum MDS codes

Cited by in corpus (7)

• Quantum codes from a new construction of self-orthogonal algebraic geometry codes
• On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes
• Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed-Solomon codes
• Locally recoverable $J$-affine variety codes
• On Steane-Enlargement of Quantum Codes from Cartesian Product Point Sets
• Stabilizer quantum codes defined by trace-depending polynomials
• New quantum codes from homothetic-BCH codes