Classical and Quantum Evaluation Codes at the Trace Roots

DOI10.1109/TIT.2018.2868442zbMATH Open1431.94146arXiv1710.02160OpenAlexW3101065667WikidataQ129299669 ScholiaQ129299669MaRDI QIDQ5223953FDOQ5223953

Authors: Carlos Galindo, Fernando Hernando, Diego Ruano 

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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 [1] for the binary case. Moreover, we obtain several classical linear codes over the field $mathbb{F}_4$ which are records at [2].

Full work available at URL: https://arxiv.org/abs/1710.02160

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Linear codes (general theory) (94B05)

Cited In (8)

• Large Hermitian hull GRS codes of any given length
• On steane-enlargement of quantum codes from Cartesian product point sets
• On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes
• Stabilizer quantum codes defined by trace-depending polynomials
• Quantum codes from a new construction of self-orthogonal algebraic geometry codes
• Locally recoverable \(J\)-affine variety codes
• On subfield subcodes obtained from restricted evaluation codes
• Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed-Solomon codes

This page was built for publication: Classical and Quantum Evaluation Codes at the Trace Roots

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