arXiv (All)
open access
The 3/4 Conjecture for q-Ary Fix-Free Codes With at Most Three Distinct Codeword Lengths
We prove the \(3/4\) conjecture for \(q\)-ary fix-free codes with at most three distinct codeword lengths, for every integer \(q\geq2\). Every prescribed length distribution with Kraft sum at most \(3/4\) is realized by a deterministic construction. We introduce a matrix approach based on an exact i
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
- Infinite families of 3-designs from linear and nonlinear codes#1109523
- Lower Bounds for all List-Decodable Deletion Codes#1062537
- On the lengths of MDS codes with a two-transitive permutation automorphism group#972228
- Minimum Schubert Codewords and Second-Minimum Grassmann Codewords#974636
- Systematic Codes Correcting Two Deletions with Three Redundant Symbols over Large Alphabets#1142860
Record · ID 1012437
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