Listar por tema "subfield-subcodes"
Mostrando ítems 1-4 de 4
-
Classical and Quantum Evaluation Codesat the Trace Roots
IEEE (2019-04)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 ... -
New binary and ternary LCD codes
IEEE (2018-05-09)LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field ... -
Optimal (r,δ)-LRCs from monomial-Cartesian codes and their subfield-subcodes
Springer (2024-05-02)We study monomial-Cartesian codes (MCCs) which can be regarded as (r,δ)-locally recoverable codes (LRCs). These codes come with a natural bound for their minimum distance and we determine those giving rise to (r,δ)-optimal ... -
Stabilizer quantum codes defined by trace-depending polynomials
Elsevier (2022-12-29)Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace [18]. In this paper, we propose to evaluate polynomials at the roots of trace-depending ...