5 citations · 8 across the 2 of their papers we have counts for
1 paper · 1 filter
K. Ilambharathi, G. S. N. V. Venkata Manik, N. Sadagopan +1
In this paper, we revisit the classical data compression problem for domain specific texts. It is well-known that classical Huffman algorithm is optimal with respect to prefix enco…