On the cost of worst case coding length constraints

IEEE Transactions on Information Theory

Volumn 47, Issue 7, 2001, Pages 3088-3090

  Baron, Dror ^a,b   Singer, Andrew C ^a,b  

^a IEEE   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Data compression; Fibonacci numbers; Huffman coding; Redundancy; Source coding; Uniquely decodable

Indexed keywords

HUFFMAN CODES;

ALGORITHMS; CODES (SYMBOLS); DATA COMPRESSION; DIFFERENCE EQUATIONS; PROBABILITY;

ENCODING (SYMBOLS);

EID: 0035504161     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.959291     Document Type: Article

References (6)

1. Space-efficient construction of optimal prefix codes
2. On the redundancy of optimal codes with limited word length
3. A method for the construction of minimum redundancy codes
4. A note on D-ary Huffman codes