Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
DOI10.1007/s10623-020-00726-xzbMath1454.94127arXiv1907.11812OpenAlexW3004673800MaRDI QIDQ782861
Ivan Soprunov, Gretchen L. Matthews, Hiram H. López-Valdez
Publication date: 29 July 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.11812
dual codesquantum codesevaluation codesaffine-Cartesian codeslinear complementary dual (LCD)local recoverymonomial-Cartesian codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)
Related Items
Cites Work
- Complementary dual codes for counter-measures to side-channel attacks
- Lattice polytopes in coding theory
- On the next-to-minimal weight of affine Cartesian codes
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
- Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
- Projective Reed-Muller type codes on rational normal scrolls
- Duality for some families of correction capability optimized evaluation codes
- On the structure of generalized toric codes
- Linear codes with complementary duals
- Generalized Hamming weights of affine Cartesian codes
- Locally recoverable codes from rational maps
- Reed-Muller-type codes over the Segre variety
- Toric codes over finite fields
- Weighted Reed-Muller codes revisited
- Projective nested Cartesian codes
- On the distance of stabilizer quantum codes from \(J\)-affine variety codes
- Affine Cartesian codes with complementary duals
- Affine Cartesian codes
- On the second Hamming weight of some Reed-Muller type codes
- A Family of Optimal Locally Recoverable Codes
- Reed‐muller codes: an ideal theory approach
- Multiple-particle interference and quantum error correction
- Nonbinary Stabilizer Codes Over Finite Fields
- On Quantum and Classical BCH Codes
- Decoding Linear Error-Correcting Codes up to Half the Minimum Distance with Gröbner Bases
- On the generalized Hamming weights of product codes
- Fundamentals of Error-Correcting Codes
- Monomial Algebras
- Toric Surface Codes and Minkowski Length of Polygons
- Bringing Toric Codes to the Next Dimension
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item