6 citations · 7 across the 3 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2008★ 1 cited
Efficient Implementation of the Generalized Tunstall Code Generation Algorithm
Michael B. Baer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources,…
cs.IT2006★ 6 cited
Prefix Codes for Power Laws with Countable Support
Michael B. Baer
In prefix coding over an infinite alphabet, methods that consider specific distributions generally consider those that decline more quickly than a power law (e.g., Golomb coding).…