Design and analysis of dynamic Huffman codes
Journal of the ACM (JACM)
Application of splay trees to data compression
Communications of the ACM
Storing text retrieval systems on CD-ROM: compression and encryption considerations
ACM Transactions on Information Systems (TOIS)
Text compression
Elements of information theory
Elements of information theory
Introduction to coding and information theory
Introduction to coding and information theory
Handbook of formal languages, vol. 1
Theory of Codes
PCM '01 Proceedings of the Second IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Optimal Maximal Encoding Different from Huffman Encoding
ITCC '01 Proceedings of the International Conference on Information Technology: Coding and Computing
IEEE Transactions on Information Theory
Existence of optimal prefix codes for infinite source alphabets
IEEE Transactions on Information Theory
| Hi-index | 0.01 |
Novel maximal coding compression techniques for the most important file-the text file of any full-text retrieval system are discussed in this paper. As a continuation of our previous work, we show that the optimal maximal coding schemes coincide with the optimal uniquely decodable coding schemes. An efficient algorithm generating an optimal maximal code (or an optimal uniquely decodable code) is also given. Similar to the Huffman codes, from the computational difficulty and the information-theoretic impossibility point of view, the problem of breaking an optimal maximal code is further investigated. Due to the Huffman code being a proper subclass of the optimal maximal code, which is good at applying to a large information retrieval system and consequently improving the system security.