A dynamical systems proof of Kraft–McMillan inequality and its converse for prefix-free codes
From MaRDI portal
Publication:5251421
DOI10.1063/1.3080885zbMath1311.94039OpenAlexW2019313441WikidataQ42616478 ScholiaQ42616478MaRDI QIDQ5251421
Publication date: 20 May 2015
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.3080885
Applications of dynamical systems (37N99) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Decoding (94B35) Prefix, length-variable, comma-free codes (94A45) Coding theorems (Shannon theory) (94A24)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Arithmetic coding as a non-linear dynamical system
- Arithmetic Coding
- Reversible arithmetic coding for quantum data compression
- A quantum analog of Huffman coding
- Trading quantum for classical resources in quantum data compression
- Two inequalities implied by unique decipherability
- A Method for the Construction of Minimum-Redundancy Codes