arXiv (All)
open access
Norm-One Torus Decompositions and Decoding of Gashkov-Sidel'nikov Codes
Let $q=3^m$, let $K=\mathbb F_{q^2}$, and let \[\mathcal T=\{x\in K^*:\operatorname{N}_{K/\mathbb F_q}(x)=1\}.\] For both cyclic and constacyclic Gashkov-Sidel'nikov codes, we show that the set of signed parity-check column labels is precisely $\mathcal T$. Consequently, the decoding problem separat
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
- Structured lattices and their applications to security#287057
- A nowhere-zero point for several linear mappings simultaneously#1013667
- Ball codes: A coding characterization of Hausdorff and packing dimensions#798205
- Ball codes: A coding characterization of Hausdorff and packing dimensions#796792
- All four Liouville sign patterns occur in the binary decompositions of every integer N ≥ 11#1079061
Record · ID 1034222
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