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

## TL;DR

This paper introduces monomial-Cartesian codes, generalizes existing code families, describes their duals, and explores applications in quantum error correction and locally recoverable codes with multiple recovery options.

## Contribution

It provides a dual code description for monomial-Cartesian codes and demonstrates their applications in constructing quantum and locally recoverable codes.

## Key findings

- Duals of monomial-Cartesian codes are characterized using vanishing ideals.
- Existence of quantum error-correcting codes derived from these codes.
- Product codes exhibit local recoverability with multiple recovery options.

## 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.