1 |
K. Sayood, Introduction to Data Compression, 3rd ed. Morgan Kaufmann, 2006.
|
2 |
D. Huffman, "A method for the construction of minimum redundancy codes," Proc. of the IRE, vol.40, no.90, pp.1098-1101, 1952. DOI:10.1109/JRPROC.1952.273898
DOI
|
3 |
E. S. Schwartz and B. Kallick, "Generating a canonical prefix encoding," Communications of the ACM, vol.7, no.3, pp.166-169, 1964. DOI:10.1145/363958.363991
DOI
|
4 |
S. Park, "Efficient Huffman decoding using canonical Huffman tree," J. of KSCI, vol.12, no.4, pp.111-117, 2007.
|
5 |
S. Park, "A study on selective encryption of Huffman codes," J. Information and Security, vol.7, no.2, pp.57-63, 2007.
|