arXiv (All)
open access
New Methods for Constructing Classical and Quantum Codes from Graphs and Matroids
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 g
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Efficient construction of subspace design codes over constant alphabet#1354380
- New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance#139149
- Edge codes constructed from unicyclic graphs#799611
- Shortest self-orthogonal embeddings of binary linear codes#925845
- Embedding linear codes over Z4 into self-orthogonal codes#925178
Record · ID 1200268
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive