@MISC{HUFFMAN1.MIZ,
  AUTHOR = {Okazaki, Hiroyuki and Futa, Yuichi and Shidama, Yasunari},
  TITLE = {Constructing Binary {H}uffman Tree},
  SECTION1 = {Constructing Binary Decoded Trees},
  SECTION2 = {Binary Huffman Tree},
  DAY = {18},
  MONTH = {June},
  YEAR = {2013},
  ADDRESS1 = {Shinshu University, Nagano, JAPAN},
  ADDRESS2 = {Japan Advanced Institute of Science and Technology, Ishikawa, JAPAN},
  ADDRESS3 = {Shinshu University, Nagano, JAPAN},
  SUMMARY = {Huffman coding is one of a most famous entropy
    encoding methods for lossless data compression \cite{HUFFMAN52}.
    JPEG and ZIP formats employ variants of Huffman encoding as
    lossless compression algorithms.
    Huffman coding is a bijective map from source letters
    into leaves of the Huffman tree constructed by the algorithm.
    In this article, we formalize an algorithm
    constructing a binary code tree, Huffman tree.},
ACKNOWLEDGEMENT = {The 1st author was supported by JSPS KAKENHI 21240001,
  and the 3rd author was supported by JSPS KAKENHI 22300285.}}

@BOOK{HUFFMAN52,
      AUTHOR = {D. A. Huffman},
      TITLE = {A method for the construction of minimum-redundancy codes},
      PUBLISHER = {Proceedings of the I.R.E},
      YEAR = {1952}}



