Tight lower bounds for optimum code length (Corresp.)
From MaRDI portal
Publication:3934287
DOI10.1109/TIT.1982.1056467zbMath0477.94013MaRDI QIDQ3934287
Publication date: 1982
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.)