New Methods for Constructing Classical and Quantum Codes from Graphs and Matroids

arXiv:2610.04617 · cs.DM, quant-ph · Submitted 2026-10-03 · Read on arXiv

cs.DM, quant-ph

Submitted: 2026-10-03

Updated: 2026-10-03

Comments: 19 pages, 4 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Generator — 9× in this paper · explained in 2 episodes
• CSS Codes — 7× in this paper · explained in 2 episodes
• Adjacency Matrix — 3× in this paper · explained in 1 episode
• Generalization — 2× in this paper · explained in 13 episodes
• Hamming Distance — 1× in this paper · explained in 2 episodes

Sources

• Linear Codes Derived from the Structure of Unit Graphs Over $\mathbb{Z}_n$

Related papers

• Automated Inference of Graph Transformation Rules