1. Chowdhury, R.A., Kaykobad, M., King, I.: An efficient decoding technique for Huffman codes. Inf. Process. Lett. 81(6), 305–308 (2002)
2. Wang, P.C., Yang, Y.R., Lee, C.L., Chang, H.Y.: A memory-efficient Huffman decoding algorithm. In: 19th International Conference on Advanced Information Networking and Applications (AINA 2005) Volume 1 (AINA papers), vol. 2, pp. 475–479. IEEE (2005)
3. Chen, B., Zhang, H.C., Cao, W.L., Feng, J.H.: Huffman coding method based on number character. In: 2007 International Conference on Machine Learning and Cybernetics, vol. 4, pp. 2296–2299. IEEE (2007)
4. Wang, S.W., Wu, J.L., Chuang, S.C., Hsiao, C.C., Tung, Y.S.: Memory efficient hierarchical lookup tables for mass arbitrary-side growing Huffman trees decoding. IEEE Trans. Circuits Syst. Video Technol. 18(10), 1335–1346 (2008)
5. Seymour, L.: Theory and Problems of Data Structures. Mcgraw-Hill Book Company, pp. 249–255 (2002)