A BIT-LEVEL TEXT COMPRESSION SCHEME BASED ON THE HCDC ALGORITHM

H. Al-Bahadili and A. Rababa’a

References

  1. [1] D. Salmon, Data compression: The complete reference, (Second Edition, Springer-Verlag, London, UK, 2001).
  2. [2] K. Sayood, Introduction to data compression, (Third Edition, Morgan Kaufmann Publishers, San Francisco, USA, 2006).
  3. [3] R. Gryder & K. Hake, Survey of data compression techniques, Report, ORNL/TM-11797, Oak Ridge National Laboratory, USA, 1991.
  4. [4] S.W. Smith, The scientist and engineer’s guide to digital signal processing, (First Edition, California Technical Publishing, California, USA, 1997).
  5. [5] G. Caire, S. Shamai, & S. Verdu, Noiseless data compression with low-density parity-check codes, in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 66 (Eds.: P. Gupta & G. Krawer), Oct. 2004, Rodhe Island, USA, 263–284.
  6. [6] N. Memon & X. Wu, Recent developments in context-based predictive techniques for lossless image compression, The Computer Journal, 40 (2/3), 1997, 127–136.
  7. [7] G.W. Drost & N.G. Bourbakis, A hybrid system for real-time lossless image compression, Microprocessors and Microsystems, 25 (1), 2001, 19–31.
  8. [8] H. Yu-Chen & C.C. Chang, A new lossless compression scheme based on Huffman coding scheme for image compression, Signal Processing: Image Communication, 16 (4), 2000, 367–372.
  9. [9] A.Z. Asli & S. Alipour, An effective method for still image compression-decompression for transmission on PSTN lines based on modification of Huffman coding, Computer and Electrical Engineering, 30 (2), 2004, 129–145.
  10. [10] M.K. Pandya, Data compression: Efficiency of varied compression techniques, Report, University of Brunel, UK, 2000.
  11. [11] L. Rueda & J. Oommen, A fast and efficient nearly-optimal adaptive Fano coding scheme, Journal of Information Science, 176 (12), 2006, 1656–1683.
  12. [12] D.A. Huffman, A method for the construction of minimumredundancy codes, Proceedings of Institute of Radio Engineers (I.R.E.), 40 (9), 1952, 1098–1101.
  13. [13] D.E. Knuth, Dynamic Huffman coding, Journal of Algorithms, 6 (2), 1985, 163–180.
  14. [14] J.S. Vitter, Dynamic Huffman coding, Journal of ACM, 15 (2), 1989, 158–167.
  15. [15] P.G. Howard & J.S. Vitter, Arithmetic coding for data compression, Proceedings of the IEEE, 82 (6), 1994, 857–865.
  16. [16] I.H. Witten, R.M. Neal, & J.G. Cleary, Arithmetic coding for data compression, Communications of the ACM: Computing Practices, 30 (6), 1987, 520–540.
  17. [17] J. Ziv & A. Lempel, Compression of information sequences via variable-rate coding, IEEE Transaction on Information Theory, 24 (5), 1978, 530–536.
  18. [18] J. Ziv & A. Lempel, A universal algorithm for sequential data compression, IEEE Transaction on Information Theory, 23 (3), 1977, 337–343.
  19. [19] M. Nelson, LZW data compression, Dr Dobb’s Journal, 14 (10), 1989, 62–75.
  20. [20] H. Plantinga, An asymmetric semi-adaptive text compression algorithm, Report, TR 94-01, University of Pittsburgh, PA, USA, 1994.
  21. [21] H. Al-Bahadili & S. Hussain, An adaptive character wordlength algorithm for data compression, Journal of Computers & Mathematics with Applications, 55 (6), 2008, 1250–1256.
  22. [22] H. Al-Bahadili, A novel data compression scheme based on the error correcting Hamming code, Journal of Computers & Mathematics with Applications, 56 (1), 2008, 143–150.
  23. [23] R.W. Hamming, Error detecting and error correcting codes, Bell System Technical Journal, 29, 1950, 147–160.
  24. [24] A. Tanenbaum, Computer networks, (Fourth Edition, Prentice Hall, Upper Saddle River, New Jersey, USA, 2003).
  25. [25] G. Caire, S. Shamai, & S. Verdu, Lossless data compression with error correction codes, Proc. 2003 IEEE International Symposium on Information Theory, 2003, Pacifico Yokohama, Kanagawa, Japan, June 29-July 4, 22.
  26. [26] G. Caire, S. Shamai, & S. Verdu, A new data compression algorithm for sources with memory based on error correcting codes, Proc. 2003 IEEE Workshop on Information Theory, Paris, France, 2003, 291–295.
  27. [27] T.C. Bell, I.H. Witten, & J.G. Cleary, Text compression (Englewood Cliffs, NJ: Prentice Hall, 1990).
  28. [28] T.C. Bell, I.H. Witten, & J.G. Cleary, Modelling for text compression, ACM Computing Surveys, 21 (4), 1989, 557–591.
  29. [29] R. Arnold & T.C. Bell, A corpus for the evaluation of lossless compression algorithms, Report, Department of Computer Science, University of Canterbury, New Zealand, 1997.
  30. [30] http://corpus.canterbury.ac.nz/description (accessed June, 2007).
  31. [31] A.A. Sharieh, An enhancement of Huffman coding for the compression of multimedia files, IEEE Transactions on Engineering: Computing and Technology, 3, 2004, 303–305.
  32. [32] M.V. Mahoney, Fast text compression with neural networks, Proc. 13th International Florida Artificial Intelligence Research Society Conf., 2000, 230–234.

Important Links:

Go Back