arXiv (All)
open access
The Neighbor Graph of Linear Complementary Dual (LCD) Codes
Linear complementary dual (LCD) codes form an important class of linear codes with applications in cryptography, classical error correction, and quantum coding theory. In this paper, we study the neighbor relation on LCD codes over finite fields and the graph induced by this relation, where two code
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
- Shortest self-orthogonal and LCD embeddings of linear codes over Fq+uFq#784973
- Shortest self-orthogonal and LCD embeddings of linear codes over Fq+uFq#783383
- Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes#644394
- Linear programming bounds for binary and ternary LCD Codes#1109155
- Rank and classification of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard codes#973837
Record · ID 984492
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