arXiv (All)
open access
New distance bounds for one-generator quasi-cyclic codes with applications to Hermitian LCD codes and entanglement-assisted quantum codes
We introduce lower bounds on the minimum distance of one-generator quasi-cyclic codes of arbitrary index, obtained by puncturing and shortening the code at the level of its blocks. For balanced codes, these bounds form a nondecreasing chain whose first term is the Jensen bound. We apply these bounds
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
- Cyclicity of Binary Group Codes.#1173
- Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size#971974
- On the Hamming distance properties of group codes#490073
- Non-norm criteria and optimal $2\times 2$ space-time block codes over rings of integers of imaginary quadratic fields#189148
- Non-norm criteria and optimal $2\times 2$ space-time block codes over rings of integers of imaginary quadratic fields#189098
Record · ID 1105858
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