arXiv (All)
open access
Entropy/Length Profile Bounds for the Conversion of (Non)linear Codes in the Merge Regime
Code conversion changes the parameters of encoded data while avoiding complete decoding and re-encoding. Existing general bounds largely rely on the algebraic structure of linear codes. This paper develops an information-theoretic framework for nonlinear code conversion in the merge regime. Using th
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
- codes_analyses#253902
- When isometry and equivalence for skew constacyclic codes coincide#1199685
- Super Special Codes using Super Matrices#93645
- Upper and lower bounds on the OBDD-width of a special integer multiplication#818720
- Upper and lower bounds on the OBDD-width of a special integer multiplication#808728
Record · ID 1326502
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