A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes. Milidiú, R. L., Pessoa, A. A., & Laber, E. S. In Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, SPIRE/CRIWG 1999, Cancun, Mexico, September 21-24, 1999, pages 128--134, 1999.
A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/spire/MilidiuPL99,
  author    = {Ruy Luiz Milidi{\'{u}} and
               Artur Alves Pessoa and
               Eduardo Sany Laber},
  title     = {A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy
               Prefix Codes},
  booktitle = {Sixth International Symposium on String Processing and Information
               Retrieval and Fifth International Workshop on Groupware, {SPIRE/CRIWG}
               1999, Cancun, Mexico, September 21-24, 1999},
  pages     = {128--134},
  year      = {1999},
  crossref  = {DBLP:conf/spire/1999},
  url       = {https://doi.org/10.1109/SPIRE.1999.796587},
  doi       = {10.1109/SPIRE.1999.796587},
  timestamp = {Wed, 24 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.dagstuhl.de/rec/bib/conf/spire/MilidiuPL99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

Downloads: 0