8 citations · 8 across the 3 of their papers we have counts for
1 paper · 1 filter
Ian Blanes, Miguel Hernández-Cabronero, Joan Serra-Sagristà +1
In this paper we provide a method to obtain tight lower bounds on the minimum redundancy achievable by a Huffman code when the probability distribution underlying an alphabet is on…