Abstract
Arithmetic Coding and Huffman Coding are among the most common lossless compression algorithms. Their compression performances are relatively low as compared to some other tools. Still, they have widespread acceptance due to their high throughput rates. Both algorithms exploit symbol frequencies to achieve compression, which can be increased by redistributing the symbol statistics in a recoverable manner. We introduce a symbol redistributing scheme to serve as a preprocessor to improve compression. The preprocessor itself is an encryption machine providing compression and simple security. The preprocessor is succeeded by conventional compression tool to offer further compression. The overall scheme is called the Secure Compressor (SeCom). The system employing Arithmetic or Huffman Coding as compressor has been implemented and tested on sample texts in English and Turkish. Results show that SeCom considerably improves compression performances of both algorithms and introduces security to the system, as well.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Nelson, M.: Arith. Coding+Stat. Modeling=Data Comp. Dr. Dobb’s Journal (1991)
Smith, S.W.: The Scientist and Engineer’s Guide to Digital Signal Processing. In: Data Compression, ch. 27, USA (2000)
Teahan, W.J.: Modelling English Text. D.Phil. thesis, The University of Waikato, Hamilton, New Zealand (1998)
Nelson, M.: The Data Compression Book. M&T Publishing, New York (1996)
Lelewer, D.A., Hirschberg, D.S.: Data Compression. ACM Computing Surveys 19(3) (September 1987)
Chiang, L.: Lossless and Lossy Image Compression, Digital Data Compression, PhD Thesis (February 1998), http://www.image.cityu.edu.hk/~loben/thesis.node2.htm
Witten, I., Moffat, A., Bell, T.C.: Managing Gigabytes Compressing and Indexing Documents and Images, 2nd edn. Morgan Kauffman Publishers, Inc., San Francisco (1999)
Calgary Corpus: http://ftp.cpcs.ucalgary.ca/pub/projects/text.compression.corpus
Canterbury Corpus: http://corpus.canterbury.ac.nz
Diri, B.: A System Based on the Analysis, Complying With the Turkish Language Structure, and Dynamic Word Based Lossless Compression of Turkish Texts, PhD Thesis (in Turkish), Yildiz Technical University, Istanbul, Turkey (1999)
Celikel, E.: Modelling and Compression of Turkish Texts., PhD Thesis (in Turkish), Ege University, International Computer Institute, Izmir, Turkey (2004)
Stinson, D.R.: Cryptography Theory and Practice. CRC Press, USA (1995)
Shannon, C.: A Mathematical Theory of Communication. The Bell Sytem Technical Journal 27, 379–423, 623-656 (1948)
Dalkilic, M.E., Dalkilic, G.: On the Entropy, Redundancy and Compression of Contemporary Printed Turkish. In: Proceedings of International Symposium on Computer and Information Sciences (ISCIS) XV, October 11-13, pp. 60–67. Yildiz Technical University, Istanbul (2000)
Burrows, M., Wheeler, D.J.: A Block-Sorting Lossless Data Compression Algorithm. In: Digital Systems Research Center, 130 Lytton Avenue, Palo Alto, California, USA (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Celikel, E., Dalkılıç, M.E. (2004). A Preprocessor Adding Security to and Improving the Performances of Arithmetic and Huffman Codings. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2004. Lecture Notes in Computer Science, vol 3261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30198-1_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-30198-1_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23478-4
Online ISBN: 978-3-540-30198-1
eBook Packages: Computer ScienceComputer Science (R0)