Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

Abstract: A monomial-Cartesian code is an evaluation code defined by evaluating a set of monomials over a Cartesian product. It is a generalization of some families of codes in the literature, for instance toric codes, affine Cartesian codes and

J

-affine variety codes. In this work we use the vanishing ideal of the Cartesian product to give a description of the dual of a monomial-Cartesian code. Then we use such description of the dual to prove the existence of quantum error correcting codes and MDS quantum error correcting codes. Finally we show that the direct product of monomial-Cartesian codes is a locally recoverable code with

t

-availability if at least

t

of the components are locally recoverable codes.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes

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