arXiv (All)
open access
DS and AMDS Symbol-Pair Codes from Three Families of Simple Root Cyclic Codes
Symbol-pair distances of simple-root cyclic codes are important for evaluating error correction performance under overlapping pair read channels. In this paper, we construct three families of simple-root cyclic codes over finite fields of odd characteristic via generator polynomials. For length \(2q
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
- New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance#139149
- Linear Complementary Pairs of Quasi-Cyclic and Quasi-Twisted Codes#1342315
- Near-uniform $q$-matroids#1142138
- Solutions to Three Conjectures and an Open Problem on Binary BCH Codes#819973
- Edge codes constructed from unicyclic graphs#799611
Record · ID 1325331
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