arXiv (OAI Expanded)
open access
Shortest self-orthogonal and LCD embeddings of linear codes over Fq+uFq
This paper determines the exact lengths of shortest self-orthogonal and LCD embeddings of linear codes over $\mathbb{F}_q+u\mathbb{F}_q$. By decomposing Gram matrices over $\mathbb{F}_q+u\mathbb{F}_q$ into pairs of symmetric matrices over the finite field $\mathbb{F}_q$, the embedding problems are r
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
- Embedding linear codes over Z4 into self-orthogonal codes#925178
- Embedding linear codes over Z4 into self-orthogonal codes#920943
- Shortest self-orthogonal embeddings of binary linear codes#925845
- On the lengths of MDS codes with a two-transitive permutation automorphism group#972228
Record · ID 783383
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