scientific article; zbMATH DE number 4210045

MaRDI QIDQ3358644zbMATH OpenFDO

Authors Raymond W. Yeung

Publication date 1991

zbMATH Keywords

Huffman codelocal redundancylower boundsprefix codeprogressive boundsredundancy theoremsource distributionupper bounds

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Bounds on codes (94B65)

Recommendations

• Bounds on the redundancy of Huffman codes (Corresp.)
• Tight Bounds on the Redundancy of Huffman Codes\hbox{ H }\hbox{ H }
• Tight bounds on the redundancy of Huffman codes
• Redundancy-Related Bounds for Generalized Huffman Codes
• Tight upper bounds on the redundancy of Huffman codes
• New bounds on the redundancy of Huffman codes
• A simple upper bound on the redundancy of Huffman codes
• On the redundancy of binary Huffman codes (Corresp.)
• The Renyi redundancy of generalized Huffman codes
• On the redundancy achieved by Huffman codes

Cited in

(6)

• On the redundancy achieved by Huffman codes
• New bounds on the redundancy of Huffman codes
• On the redundancy of binary Huffman codes (Corresp.)
• Redundancy-Related Bounds for Generalized Huffman Codes
• Optimal binary search trees
• Old and new results on alphabetic codes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358644)