Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 4 min ago
PreprintarXiv licencearXiv

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

  • Anderson S. Barbosa
  • Franklin de L. Marquezino
  • Giuliano G. La Guardia
Open at sourcePDFDOICite

Abstract

In this paper, we present a method for constructing linear codes derived from book graphs. Applying such a method, we construct binary codes that have the greatest possible minimum distance for their length and dimension by means of the $2$-sum of two equal book graphs. We then utilize matroid and graph theory together to investigate some properties of the resulting linear codes. Furthermore, we show that, from the incidence matrix of any graph, we can obtain a linear code over any finite field maintaining the same parameters. Furthermore, we show how the condition for two linear codes to generate a Calderbank-Shor-Steane (CSS) code translates into matroid theory and, utilizing cycle graphs, we exhibit a way to generate codes that meet this condition.

Related

  1. Quantum-Classical Hybrid Methods for Optimization: Lessons from Classical Decomposition
    David E. Bernal Neira
    arXivPreprintarXiv licenceFull textOptimisation & controlQuantum physics & quantum informationarXiv
  2. Whither quantum advantage? New classical lower bounds for Max-Cut on large-girth 3-regular graphs
    Flaviano Morone, Shivang Rawat, Dries Sels
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsCondensed matterarXiv
  3. Empirical Evaluation of Quantum Kernel Methods for Classification: A Comparative Study with Classical Kernels
    Ronak Bhalgami
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  4. Need for Coherent Access in Constructing Quantum Cryptography
    Minki Hhan, Changhun Oh, Vaughn Sohn
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  5. On Constructing and Decoding Quantum Triorthogonal Codes
    Alessio Baldelli, Olai Å. Mostad, Hsuan-Yin Lin +2
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv

Cite

BibTeXRIS
BibTeX
@misc{barbosa2026methods,
  title = {{New Methods for Constructing Classical and Quantum Codes from Graphs and Matroids}},
  author = {Anderson S. Barbosa and Franklin de L. Marquezino and Giuliano G. La Guardia},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.04617},
  eprint = {2610.04617},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.04617},
}
RIS
TY  - UNPB
TI  - New Methods for Constructing Classical and Quantum Codes from Graphs and Matroids
AU  - Anderson S. Barbosa
AU  - Franklin de L. Marquezino
AU  - Giuliano G. La Guardia
PY  - 2026
DA  - 2026/10/03
PB  - arXiv
DO  - 10.48550/arxiv.2610.04617
UR  - https://arxiv.org/abs/2610.04617
AB  - In this paper, we present a method for constructing linear codes derived from book graphs. Applying such a method, we construct binary codes that have the greatest possible minimum distance for their length and dimension by means of the $2$-sum of two equal book graphs. We then utilize matroid and graph theory together to investigate some properties of the resulting linear codes. Furthermore, we show that, from the incidence matrix of any graph, we can obtain a linear code over any finite field maintaining the same parameters. Furthermore, we show how the condition for two linear codes to generate a Calderbank-Shor-Steane (CSS) code translates into matroid theory and, utilizing cycle graphs, we exhibit a way to generate codes that meet this condition.
ER  -