On the cost of worst case coding length constraints

DOI10.1109/18.959291zbMath1002.94008OpenAlexW2127925184MaRDI QIDQ4544758

Dror Baron, Andrew C. Singer

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/566cb24073f3317394a26a0c6c18a527d5599905

zbMATH Keywords

data compressionFibonacci numbersredundancyHuffman codingsource codinguniquely decodable codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)

This page was built for publication: On the cost of worst case coding length constraints