1. [1] D. A. Huffman: “A method for the construction of minimum-redundancy codes,” Proc. IRE 40 (1952) 1098 (DOI: 10.1109/JRPROC.1952.273898).
2. [2] P. K. Shukla, et al.: “Multiple subgroup data compression technique based on Huffman coding,” First International Conference on Computational Intelligence, Communication Systems and Networks (2009) 397 (DOI: 10.1109/CICSYN.2009.86).
3. [3] W. W. Lu and M. P. Gough: “A fast-adaptive Huffman coding algorithm,” IEICE Trans. Commun. 41 (1993) 535 (DOI: 10.1109/26.223776).
4. [4] H. Park and V. K. Prasanna: “Area efficient VLSI architectures for Huffman coding,” IEEE Trans. Circuits Syst. 40 (1993) 568 (DOI: 10.1109/82.257334).
5. [5] A. Mukherjee, et al.: “MARVLE: A VLSI chip for variable length encoding and decoding,” IEEE International Conference on Computer Design: VlSI in Computer & Processors (1992) 170 (DOI: 10.1109/ICCD.1992.276242).