On the maximum length of Huffman codes

Information Processing Letters

Volumn 45, Issue 5, 1993, Pages 219-223

  Buro, Michael ^a  

^a FB 17 Mathematik Informatik Universität Gesamthochschule W 4790 Paderborn Germany ^*

Author keywords

code length; external path length; Huffman code

Indexed keywords

ENCODING (SYMBOLS); PROBABILITY; TREES (MATHEMATICS);

BINARY CODES; CODE LENGTH; HUFFMAN CODES; PROBABILITY DISTRIBUTION;

CODES (SYMBOLS);

EID: 0027904994     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(93)90207-P     Document Type: Article

References (2)

1. A method for the construction of minimum-redundancy codes