Results 161 to 170 of about 1,245 (171)
Some of the next articles are maybe not open access.
On the redundancy of binary Huffman codes (Corresp.)
IEEE Transactions on Information Theory, 1980exaly
Tight upper bounds on the redundancy of Huffman codes
IEEE Transactions on Information Theory, 1989exaly
Tight bounds on the codeword lengths and average codeword length for D-ary Huffman codes - Part 2
2009Daniela Tarniceriu, Valeriu Munteanu
exaly