Home Table of Contents News Blogs Opinion Research Practice Contributed Articles Review Articles Careers Archive Videos About Communications
Sign In
advertisement

Home → Magazine Archive → April 1990 (Vol. 33, No. 4) → Efficient decoding of prefix codes → Abstract

Efficient decoding of prefix codes

By Daniel S. Hirschberg, Debra A. Lelewer

Communications of the ACM, Vol. 33 No. 4, Pages 449-459
10.1145/77556.77566

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.

The full text of this article is premium content

0 Comments

No entries found