Experiments in text file compression
Communications of the ACM
Data compression techniques for economic processing of large commercial files
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
A VLSI chip for efficient transmission and retrieval of information
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
A multi-tree automation for efficient data transmission
SSDBM'83 Proceedings of the 2nd international workshop on Proceedings of the Second International Workshop on Statistical Database Management
Utilization of character reference locality for efficient storage of data base
SSDBM'83 Proceedings of the 2nd international workshop on Proceedings of the Second International Workshop on Statistical Database Management
Area efficient VLSI architectures for Huffman coding
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I
| Hi-index | 0.00 |
An efficient compression technique that is particularly attractive for the storage of large commercial files and the transfer of such files within a distributed communication network is outlined. The technique, constructed as a two-level hierarchy of Huffman-type binary trees, is a reversible semantic-independent variable-length character encoding method that makes use of the group locality of character reference behavior and the variable frequency of occurrence of various characters within the different subgroupings of the character set. The compression efficiency and cost of the Multi-Group scheme has been found to be superior to the well-known Huffman encoding algorithm.