arXiv (All)
open access
Shortest self-orthogonal embeddings of binary linear codes
There has been recent interest in the study of shortest self-orthogonal embeddings of binary linear codes, since many such codes are optimal self-orthogonal codes. Several authors have studied the length of a shortest self-orthogonal embedding of a given binary code $\mathcal C$, or equivalently, th
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
- Embedding linear codes over Z4 into self-orthogonal codes#925178
- Embedding linear codes over Z4 into self-orthogonal codes#920943
- On neighbor distances and symmetry in group codes#490081
- 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
Record · ID 925845
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