14 citations · 14 across the 1 of their papers we have counts for
1 paper · 1 filter
Mordecai Golin, Claire Mathieu, Neal E. Young
We give a polynomial-time approximation scheme for the generalization of Huffman Coding in which codeword letters have non-uniform costs (as in Morse code, where the dash is twice…