Robust transmission of unbounded strings using Fibonacci representations
IEEE Transactions on Information Theory
Data structure of Huffman codes and its application to efficient encoding and decoding
IEEE Transactions on Information Theory
Data compression: methods and theory
Data compression: methods and theory
ACM Computing Surveys (CSUR)
Fast decoding of the Huffman codes
Information Processing Letters
Arithmetic coding for data compression
Communications of the ACM
Generating a canonical prefix encoding
Communications of the ACM
An honors course in data compression
SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
Fast searching on compressed text allowing errors
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
Index compression vs. retrieval time of inverted files for XML documents
Proceedings of the eleventh international conference on Information and knowledge management
Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts
Information Retrieval
Text Compression for Dynamic Document Databases
IEEE Transactions on Knowledge and Data Engineering
Test Compression and Hardware Decompression for Scan-Based SoCs
Proceedings of the conference on Design, automation and test in Europe - Volume 1
LZ trie and dictionary compression
Software—Practice & Experience
Switching code data compression technique using an Adaptive Huffman coding
MATH'08 Proceedings of the American Conference on Applied Mathematics
ACM SIGIR Forum
Iterative Dictionary Construction for Compression of Large DNA Data Sets
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 48.22 |
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.