arXiv (All)
open access
Completely regular codes in graphs covered by a Hamming graph
In Cayley graphs on the additive group of a small vector space over GF$(q)$, $q=2,3$, we look for completely regular (CR) codes whose parameters are new in Hamming graphs over the same field. The existence of a CR code in such a Cayley graph $G$ implies the existence of a CR code with the same param
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
- Identifying codes in triangle-free graphs of bounded maximum degree#1187198
- On the lengths of MDS codes with a two-transitive permutation automorphism group#972228
- New Methods for Constructing Classical and Quantum Codes from Graphs and Matroids#1200268
- On composition and decomposition operations for vector spaces, graphs and matroids#1354052
- The generalized covering radii of Melas codes#799156
Record · ID 1356995
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