A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes.

Ruy Luiz Milidiú|Artur Alves Pessoa|Eduardo Sany Laber


Anthology ID:DBLP:conf/spire/MilidiuPL99
Volume:Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, SPIRE/CRIWG 1999, Cancun, Mexico, September 21-24, 1999
Year:1999
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:IEEE Computer Society
Pages:128-134
URL:https://doi.org/10.1109/SPIRE.1999.796587
DOI:https://doi.org/10.1109/SPIRE.1999.796587
DBLP:conf/spire/MilidiuPL99
BibTeX:
@inproceedings{milidiu-1999-fast, author = {Ruy Luiz Milidi\'{u} and Artur Alves Pessoa and Eduardo Sany Laber}, editor = {Ricardo Baeza-Yates and Edgar Ch\'{a}vez and Jes\'{u}s Favela}, 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}, publisher = {IEEE Computer Society}, year = {1999}, url = {https://doi.org/10.1109/SPIRE.1999.796587}, doi = {https://doi.org/10.1109/SPIRE.1999.796587} }