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
81 Adding Compression to a Full-Text Retrieval System – Justin Zobel, Alistair Moffat - 1995
733 Compression of Individual Sequences via Variable-Rate Coding – Jacob Ziv, Abraham Lempel - 1978
348 Universal codeword sets and representations of the integers – P Elias - 1975
795 Managing Gigabytes: Compressing and Indexing Documents and Images - Errata – I. H. Witten, A. Moffat, T. C. Bell - 1996
52 On the construction of huffman trees – J van Leeuwen - 1976
126 Information Retrieval, Computational and Theoretical Aspects – H S Heaps - 1978
662 Arithmetic coding for data compression – I H Witten, R M Neal, J G Cleary - 1987
12 Fast decoding of Huffman codes – A Sieminski - 1988
87 Data Compression – Debra A. Lelewer, Daniel S. Hirschberg - 1987
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
14 Efficient variants of Huffman codes in high level languages – Y Choueka, S T Klein, Y Perl - 1985
619 Text Compression – T Bell, J Cleary, I Witten - 1990
195 Arithmetic coding – Glen G. Langdon - 1979
12 A Huffman-Shannon-Fano code – J Brian Connell - 1973
16 Bounding the Depth of Search Trees – Aviezri S. Fraenkel, Shmuel T. Klein - 1993