Efficient Decoding of Prefix Codes (1990)

Cached

Download Links

by Daniel S. Hirschberg , Debra A. Lelewer
Venue:Communications of the ACM
Citations:31 - 0 self

Documents Related by Co-Citation

942 A method for the construction of minimum-redundancy codes – D Huffman - 1952
1137 A universal algorithm for sequential data compression – Jacob Ziv, Abraham Lempel - 1977
36 Generating a canonical prefix encoding – E S SCHWARTZ, B KALLICK - 1964
733 Compression of Individual Sequences via Variable-Rate Coding – Jacob Ziv, Abraham Lempel - 1978
81 Adding Compression to a Full-Text Retrieval System – Justin Zobel, Alistair Moffat - 1995
348 Universal codeword sets and representations of the integers – P Elias - 1975
126 Information Retrieval, Computational and Theoretical Aspects – H S Heaps - 1978
795 Managing Gigabytes: Compressing and Indexing Documents and Images - Errata – I. H. Witten, A. Moffat, T. C. Bell - 1996
12 Fast decoding of Huffman codes – A Sieminski - 1988
148 A locally adaptive data compression scheme – J Bentley, D Sleator, R Tarjan, V Wei - 1986
31 Constructing Word-Based Text Compression Algorithms – Nigel Horspool, Gordon Cormack - 1992
662 Arithmetic coding for data compression – I H Witten, R M Neal, J G Cleary - 1987
414 A technique for high-performance data compression – T Welch - 1984
95 Let Sleeping Files Lie: Pattern Matching in Z-compressed Files – Amihood Amir, Gary Benson, Martin Farach - 1994
85 String matching in Lempel-Ziv compressed strings – M FARACH, M THORUP - 1995
44 Self-synchronizing huffman codes – T Ferguson, J H Rabinowitz - 1984
81 Optimal Two-Dimensional Compressed Matching – Amihood Amir, Gary Benson, Martin Farach - 1994
619 Text Compression – T Bell, J Cleary, I Witten - 1990
229 A New Approach to Text Searching – Ricardo A. Baeza-yates, Blanco Encalada, Gaston H. Gonnet