Efficient decoding of prefix codes
Daniel S. Hirschberg, Debra A. Lelewer · Communications of the ACM · 1990
A special case of the data compression problem is presented, in which a powerful encoder transmits a coded file to a decoder that has severely constrained memory. A data structure that achieves minimum storage is presented, and alternative methods that sacrifice a small amount of storage to attain faster decoding are described.