Abstract
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.
This work was partially sponsored by the 2002 Open Project of the State Key Laboratory of Information Security (SKLOIS) (project No. 01-02), the National Natural Science Foundation of China (project No. 60073056) and the Guangdong Provincial Natural Science Foundation (project No. 001174).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berstel, J., Perrin, D.: Theory of Codes. Academic Press, Orlando (1985)
Bell, T.C., Cleary, J.G., Witten, I.H.: Text Compression. Prentice Hall. Englewood Cliffs, NJ (1990)
Cover, T, Thomas, J.: Elements of Information Theory. New York, Wiley (1991)
Fraenkel, A.S., Klein, S.T.: Complexity Aspects of Guessing Prefix Codes. Algorithmica, Vol. 12(1994), 409–419
Gillman, David, W., Mohtashemi, M., Rivest, R.L.: On Breaking a Huffman Code. IEEE Trans. Inform. Theory, IT-42(1996)3, 972–976
Klein, S.T., Bookstein, A., Deerwester, S.: Storing Text-Retrieval Systems on CD-ROM: Compression and Encryption Considerations. ACM Trans. Inform. Syst., Vol. 7(1989), 230–245
Long, D., Jia, W.: Optimal Maximal Encoding Different From Huffman Encoding. Proc. of International Conference on Information Technology: Coding and Computing (ITCC 2001), Las Vegas, IEEE Computer Society (2001) 493–497
Long, D., Jia, W.: On the Optimal Coding. Advances in Multimedia Information Processing, Lecture Notes in Computer Science 2195, Springer-Verlag, Berlin (2001) 94–101.
Huffman, D.A.: A Method for the Construction of Minimum-Redundancy Codes. Proc. IRE, Vol. 40(1952), 1098–1101
Jürgensen, H., Konstantinidis, S.: Codes. in: G. Rozenberg, A. Salomaa (editors), Handbook of Formal Languages, Vol. 1 Sringer-Verlag Berlin Heidelberg (1997) 511–607
Jones, D.W.: Applications of Splay Trees to Data Compression. Communication of ACM, Vol. 31(1988), 996–1007
Linder, T., Tarokh, V., Zeger, K.: Existence of Optimal Prefix Codes for Infinite Source Alphabets. IEEE Trans. Inform. Theory, 43(1997)6, 2026–2028
Rubin, F.: Cryptographic Aspects of Data Compression Codes. Cryptologia, Vol. 3(1979), 202–205
Roman, S.: Introduction to Coding and Information Theory. Springer-Verlag New York (1996)
Vitter, J.S.: Design and Analysis of Dynamic Huffman Codes. Journal of the Association for Computing Machinery, 34(1987)4, 825–845
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Long, D. (2002). Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme. In: Shafazand, H., Tjoa, A.M. (eds) EurAsia-ICT 2002: Information and Communication Technology. EurAsia-ICT 2002. Lecture Notes in Computer Science, vol 2510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36087-5_15
Download citation
DOI: https://doi.org/10.1007/3-540-36087-5_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00028-0
Online ISBN: 978-3-540-36087-2
eBook Packages: Springer Book Archive