Publications
- Michael Dipperstein, Huffman Code Discussion and Implementation, 2004.
[http://michael.dipperstein.com/huffman/]
- Rezaul Alam Chowdhury, M. Kaykobad and Irwin King, An efficient decoding technique for Huffman codes, Information Processing Letters, 81(6), pp. 305-308, 2002.
[http://citeseer.ist.psu.edu/chowdhury02efficient.html]
[http://www.cse.cuhk.edu.hk/~king/PUB/ipl02.pdf]
- Arturo Campos, Static Huffman, 1999.
[http://www.arturocampos.com/ac_static_huffman.html]
[http://www.arturocampos.com/ac_s_huffman_html.zip]
- Arturo Campos, When Fibbonaci and Huffman meeted, 1999.
[http://www.arturocampos.com/ac_fib_huffman.html]
[http://www.arturocampos.com/ac_fib_huff_html.zip]
- Roberto De Prisco and Alfredo De Santis, On the data expansion of Huffman compression algorithm, The Computer Journal, 41(3), pp. 137-144, 1998.
[http://citeseer.ist.psu.edu/200664.html]
[http://www.dia.unisa.it/professori/robdep/Home/Papers/cj98.ps.gz]
- Roberto De Prisco and Alfredo De Santis, On Lower Bounds for the Redundancy of Optimal Codes, Designs, codes and cryptography, 15, pp. 29-45, 1998.
[http://citeseer.ist.psu.edu/199684.html]
[http://www.dia.unisa.it/professori/robdep/Home/Papers/dcc98.ps.gz]
- Roberto De Prisco and Alfredo De Santis, A new bound on the data expansion of Huffman codes, IEEE Transactions on Information Theory, 43(6), pp. 2028-2032, 1997.
[http://citeseer.ist.psu.edu/199128.html]
[http://www.dia.unisa.it/professori/robdep/Home/Papers/huffman-DD97-ieee.ps.gz]
- Charles Bloom, Statistical Coders, 1996.
[http://www.cbloom.com/algs/statisti.html]
- Roberto De Prisco and Alfredo De Santis, On the redundancy achieved by Huffman codes, Information Sciences, 88(1-4), pp. 131-148, 1996.
[http://citeseer.ist.psu.edu/201259.html]
[http://www.dia.unisa.it/professori/robdep/Home/Papers/huffman-DD96-is.ps.gz]
- Paul Howard and Jeffrey Vitter, Parallel Lossless Image Compression Using Huffman and Arithmetic Coding, Information Processing Letters, 59, pp. 65-73, 1996.
[http://www.cs.duke.edu/~jsv/Papers/HoV95.pdcfull.ps.gz]
[http://www.cs.duke.edu/~jsv/Papers/HoV95.pdcfull.pdf]
- Abraham Bookstein and Shmuel Klein, Is Huffman Coding Dead?, Computing, 50(4), pp. 279-296, 1993.
[http://citeseer.ist.psu.edu/bookstein93is.html]
- Debra Lelewer and Daniel Hirschberg, Efficient decoding of prefix codes, Communications of the ACM, 33(4), pp. 449-459, 1990.
[http://citeseer.ist.psu.edu/hirschberg90efficient.html]
[http://www.ics.uci.edu/~dan/pubs/Prefix.ps.gz]
- Debra Lelewer and Daniel Hirschberg, Data compression, ACM Computing Surveys, 19(3), pp. 261-297, 1987.
[http://citeseer.ist.psu.edu/lelewer87data.html]
[http://www.ics.uci.edu/~dan/pubs/DataCompression.html]
[http://www.ics.uci.edu/~dan/pubs/DataCompression.ps.gz]
- Robert G. Gallager, Variations on a Theme by Huffman, IEEE Transactions on Information Theory, IT-24(6), pp. 668-674, 1978.
[http://web.mit.edu/afs/athena.mit.edu/course/6/6.441/www/reading/IT-V24-N6.pdf]
- David A. Huffman, A Method for the Construction of Minimum-Redundancy Codes, Proceedings of the IRE, 40(9), pp. 1098-1101, 1952.
[http://www.compression.ru/download/articles/huff/huffman_1952_minimum-redundancy-codes.pdf]
- Wikipedia, Huffman coding.
[http://en.wikipedia.org/wiki/Huffman_coding]
Source Code
日本語の資料