Improving Chinese Storing Text Retrieval Systems' Security via a Novel Maximal Prefix Coding

作     者：D. Y. LONG W. J. JIA P. O. AU M. LI 

作者机构：Department of Computer Science Zhongshan University Guangzhou 510275 PRC State Key Lab. of Information Security Chinese Academy of Science Beijing 100080 PRC Department of Computer Engineering and Information Technology City University of Hong Kong 83 Tat Chee Avenue Kowloon Hong Kong SAR PRC School of Computing National University of Singapore Singapore 

出 版 物：《International Journal of Computer Processing of Languages》 

年 卷 期：2002年第15卷第4期

页      面：379-393页

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Coding Data Compression Huffman Coding Maximal Prefix Coding 

摘      要：We have seen that Huffman coding has been widely used in data, image, and video compression. In this paper novel maximal prefix coding is introduced. Relationship between the Huffman coding and the optimal maximal prefix coding are discussed. We show that all Huffman coding schemes are optimal maximal prefix coding schemes and that conversely the optimal maximal prefix coding schemes need not be the Huffman coding schemes. Moreover, it is proven that, for any maximal prefix code C, there exists an information source I = (∑ P) such that C is exactly a Huffman code for I. Therefore, it is essential to show that the class of Huffman codes is coincident with one of the maximal prefix codes. A case study of data compression is also given. Comparing the Huffman coding, the maximal prefix coding is used not only for statistical modeling but also for dictionary methods. It is also good at applying to a large information retrieval system and improving its security.