An Adaptive Multiple Order Context Huffman Compression Algorithm Based on Markov Model

  • Yonghua HuoEmail author
  • Zhihao Wang
  • Junfang Wang
  • Kaiyang Qu
  • Yang Yang
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 201)


In this paper, an adaptive multiple order context Huffman compression algorithm based on Markov chain is proposed. Firstly, the data to be compressed is traversed, and the character space of the data and the times that one character transfers to its neighboring character are figured out. According to the statistical results, we can calculate the one-step transition probability matrix and the multi-step transition probability matrix. When the conditional probability between two adjacent characters is greater than the set threshold value, the adjacent characters are merged and compressed as an independent encoding unit. Improve the compression efficiency by increasing the length of the compression characters. The experimental results show that the algorithm achieves good compression efficiency.


Data compression Multiple order contexts Markov chain Huffman compression 


  1. 1.
    Kuruvila, M., Gopinath, D.P.: Entropy of Malayalam language and text compression using Huffman coding. In: First International Conference on Computational Systems and Communications. IEEE, pp. 150–155 (2014)Google Scholar
  2. 2.
    Wu, J., Dai, W., Xiong, H.: Regional context model and dynamic Huffman binarization for adaptive entropy coding of multimedia. In: IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, pp. 1–6. IEEE (2014)Google Scholar
  3. 3.
    Wang, Z., Le, J.J., Wang, M., et al.: The column storage district level data compression mode and compression strategy selection method. In: ndbc2010 National Database Conference of China, pp. 523–1530 (2010)Google Scholar
  4. 4.
    Darwiyanto, E., Pratama, H.A., Septiana, G.: Text data compression for mobile phone using burrows-wheeler transform, move-to-front code and arithmetic coding (Case Study: Sunan Ibnu Majah Bahasa Translation). In: International Conference on Information and Communication Technology, pp. 178–183. IEEE (2015)Google Scholar
  5. 5.
    Wang, W.J., Lin, C.H.: Code compression for embedded systems using separated dictionaries. IEEE Trans. Very Large Scale Integr. Syst. 24, 1 (2015)Google Scholar
  6. 6.
    Yokoo, H.: An adaptive data compression method based on context sorting. In: Data Compression Conference, pp. 160–169. IEEE (1996)Google Scholar
  7. 7.
    Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory 23(3), 337–343 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Ren, W., Wang, H., Xu, L., et al.: Research on a quasi-lossless compression algorithm based on huffman coding. In: 2011 International Conference on Transportation, Mechanical, and Electrical Engineering (TMEE), pp. 1729–1732. IEEE (2011)Google Scholar
  9. 9.
    Ong, G.H., Ng, J.P.: Dynamic Markov compression using a crossbar-like tree initial structure for chinese texts. In: International Conference on Information Technology and Applications, pp. 407–410. IEEE (2005)Google Scholar
  10. 10.
    Wei, J., Wang, S., Zhang, L., et al.: Minimizing data transmission latency by bipartite graph in MapReduce. In: IEEE International Conference on CLUSTER Computing, pp. 521–522. IEEE (2015) Google Scholar
  11. 11.
    Papamichalis, P.E.: Markov-Huffman coding of LPC parameters. IEEE Trans. Acoust. Speech Signal Proc. 33(2), 451–453 (1985)CrossRefGoogle Scholar
  12. 12.
    Nandi, U., Mandal, J.K.: Adaptive region based huffman compression technique with selective code interchanging. In: Advances in Computing and Information Technology, pp. 739–748 (2012)Google Scholar
  13. 13.
    Singh, S., Singh, H.: Improved adaptive huffman compression algorithm. Int. J. Comput. Technol. 1(1), 1–6 (2011)Google Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2017

Authors and Affiliations

  • Yonghua Huo
    • 1
    Email author
  • Zhihao Wang
    • 1
  • Junfang Wang
    • 1
  • Kaiyang Qu
    • 2
  • Yang Yang
    • 2
  1. 1.Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory54th Research Institute of China Electronics Technology Group CorporationShijiazhuangChina
  2. 2.State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and TelecommunicationsBeijingChina

Personalised recommendations