Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1907.11812 · Designs Codes and Cryptography

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

Hiram H. López, Gretchen L. Matthews, Ivan Soprunov

Published Feb 7, 2020• 16 citations
arXivHTMLPDF
DOI
10.1007/s10623-020-00726-x

Related papers

Two Families of Optimal Quantum Locally Recoverable Codes

Dengcheng Xie, Shixin Zhu, Zhonghua Sun

International Journal of Theoretical Physics•Mar 21, 2025•3 citations

The Hermitian dual-containing LCD BCH codes and related quantum codes

Fengwei Li

Cryptography and Communications•Oct 20, 2021•4 citations

Quantum Locally Recoverable Codes With Intersecting Recovery Sets

Kaifeng Bu, Weichen Gu, Xiang Li

IEEE Transactions on Information Theory•Sep 9, 2026•0 citations

Quantum Locally Recoverable Codes With Asymmetric Locality

Jiang Li, Lingfei Jin, Chaoping Xing

IEEE Transactions on Information Theory•Jun 22, 2026•0 citations

Quantum and LCD codes from skew constacyclic codes over a finite non-chain ring

Om Prakash, Ram Krishna Verma, Ashutosh Singh

Quantum Information Processing•May 6, 2023•9 citations

Quantum codes and locally recoverable codes from evaluation codes

Helena Martín-Cruz

This PhD thesis addresses two current problems belonging to the fields of classical and quantum information theory. The first is the repair problem in distributed and cloud storage systems in the setting where multiple nodes may fail simultaneously. These codes are called (r,\delta)-locally recoverable codes. To handle it, we consider monomial-Cartesian codes, resulting in new (r,\delta)-locally recoverable codes. The other problem is the construction of good quantum error-correcting codes. Those we provide are quantum stabilizer codes derived from two families of classical codes: generalized (or twisted) monomial-Cartesian codes and evaluation codes at the roots of trace-depending polynomials. Both quantum code constructions have excellent parameters.

•Jul 24, 2024•0 citations
This PhD thesis addresses two current problems belonging to the fields of classical and quantum information theory. The first is the repair problem in distributed and cloud storage systems in the setting where multiple nodes may fail simultaneously. These codes are called (r,\delta)-locally recoverable codes. To handle it, we consider monomial-Cartesian codes, resulting in new (r,\delta)-locally recoverable codes. The other problem is the construction of good quantum error-correcting codes. Those we provide are quantum stabilizer codes derived from two families of classical codes: generalized (or twisted) monomial-Cartesian codes and evaluation codes at the roots of trace-depending polynomials. Both quantum code constructions have excellent parameters.