Tight lower bounds for optimum code length (Corresp.)

DOI10.1109/TIT.1982.1056467zbMath0477.94013MaRDI QIDQ3934287

Jorma Rissanen

Publication date: 1982

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

zbMATH Keywords

binary information sourcesmean code lengthone-to-one codes for a random variable with n outcomes

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29)

Related Items (3)

New lower bounds on the cost of binary search trees ⋮ ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC ⋮ Development of two new mean codeword lengths

This page was built for publication: Tight lower bounds for optimum code length (Corresp.)