arXiv (All)
open access
Convolutional Codes from Cyclic Codes with Guaranteed Free and Local Minimum Distances
This paper presents an algebraic method to construct convolutional codes with guaranteed \emph{free and local minimum distances} without limit based on cyclic codes of odd lengths. The constructions are simple but effective, and no computer search is needed. For any two positive integers $r$ and $t$
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
- Universal Hashing and Geometric Codes#921554
- On the construction of universal families of hash functions via geometric codes and concatenation#612900
- Some MDS and ACD codes over commutative non-unital rings of orders 4 and 9 (Revision)#1033960
- New distance bounds for one-generator quasi-cyclic codes with applications to Hermitian LCD codes and entanglement-assisted quantum codes#1105858
- Periodicity of weight enumerators for codes generated by an integral matrix#1069734
Record · ID 985664
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