arXiv (All)
open access
Stall Pattern Avoidance in Polynomial Product Codes
Product codes are a concatenated error-correction scheme that has been often considered for applications requiring very low bit-error rates, which demand that the error floor be decreased as much as possible. In this work, we consider product codes constructed from polynomial algebraic codes, and pr
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
- Periodicity of weight enumerators for codes generated by an integral matrix#1069734
- 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
- Non-norm criteria and optimal $2\times 2$ space-time block codes over rings of integers of imaginary quadratic fields#189048
- Non-norm criteria and optimal $2\times 2$ space-time block codes over rings of integers of imaginary quadratic fields#188998
Record · ID 1061540
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