Efficient implementation of the WARM-UP algorithm for the construction of length-restricted prefix codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1619, Issue , 1999, Pages

  Milidiú, Ruy Luiz ^a   Pessoa, Artur Alves ^a   Laber, Eduardo Sany ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMATIVE METHOD; EFFICIENT IMPLEMENTATION; EXACT METHODS; INPUT WEIGHTS; OPTIMAL CODES; PREFIX CODES; SPACE USAGE; TIME COMPLEXITY;

CODES (SYMBOLS);

EID: 84978971173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48518-x_1     Document Type: Conference Paper

References (26)

1. Aggarwal, Schieber, and Tokuyama. Finding a minimum-weight k-link path in graphs with the concave monge property and applications. GEOMETRY: Discrete & Computational Geometry, 12, 1994.
2. J. Brian Connell. A Huffman-Shannon-Fano code. In Proceedings of the IEEE, volume 61, pages 1046-1047, July 1973.
3. Shimon Even. Graph Algorithms. Computer Science Press, 1979.
4. A. S. Fraenkel and S. T. Klein. Bounding the depth of search trees. The Computer Journal, 36(7):668-678, 1993.
5. R.G. Gallager. Variations on a theme of huffman. IEEE Transaction on Information Theory, IT-24(6):668-674, November 1978.
6. D. Harman. Overview of the second text retrieval conference (trec-2). Information Processing Management, 31(3):271-289, 1995.
7. D. A. Huffman. A method for the construction of minimum-redundancy codes. In Proc. Inst. Radio Eng., pages 1098-1101, September 1952. Published as Proc. Inst. Radio Eng., volume 40, number 9.
8. Katajainen, Moffat, and Turpin. A fast and space-economical algorithm for length-limited coding. In ISAAC: 6th International Symposium on Algorithms and Computation (formerly SIGAL International Symposium on Algorithms), Organized by Special Interest Group on Algorithms (SIGAL) of the Information Processing Society of Japan (IPSJ) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers (IEICE), 1995.
9. Lawrence L. Larmore and Daniel S. Hirschberg. A fast algorithm for optimal length-limited Huffman codes. Journal of the ACM, 37(3):464-473, July 1990.
10. Ruy L. Milidiu and Eduardo S. Laber. Warm-up algorithm: A lagrangean construction of length restricted huffman codes. Technical Report 15, Departamento de Informatica, PUC-RJ, Rio de Janeiro, Brasil, January 1996.
11. Ruy L. Milidiu and Eduardo S. Laber. Improved bounds on the inefficiency of length restricted codes. Technical Report 33, Departamento de Informatica, PUC-RJ, Rio de Janeiro, Brasil, January 1997.
12. Ruy L. Milidiu, Artur A. Pessoa, and Eduardo S. Laber. Practical use of the warmup algorithm on length-restricted codes. In Ricardo Baeza-Yates, editor, Proceedings of the Fourth Latin American Workshop on String Processing, volume 8 of International Informatics Series, pages 80-94, Valparaiso, Chile, November 1997. Carleton University Press.
13. Ruy L. Milidiu, Artur A. Pessoa, and Eduardo S. Laber. A space-economical algorithm for minimum-redundancy coding. Technical Report 02, Departamento de Informática, PUC-RJ, Rio de Janeiro, Brasil, January 1998.
14. Ruy L. Milidiu, Artur A. Pessoa, and Eduardo S. Laber. Two space-economical algorithms for calculating minimum redundancy prefix codes. In Proceedings of the DCC (to appear), March 1999.
15. A. Moffat and A. Turpin. On the implementation of minimum-redundancy prefix codes. IEEE Transactions on Communications, 45(10):1200-1207, October 1995.
16. A. Moffat and A. Turpin. Efficient construction of minimum-redundancy codes for large alphabets. IEEE Transactions on Information Theory, 44(4), July 1998.
17. Alistair Moffat and Jyrki Katajainen. In-place calculation of minimum-redundancy codes. In Selim G. Akl, Frank K. H. A. Dehne, Jorg-Rudiger Sack, and Nicola Santoro, editors, Algorithms and Data Structures, 4th International Workshop, volume 955 of Lecture Notes in Computer Science, pages 393-402, Kingston, Ontario, Canada, 16-18 August 1995. Springer.
18. Edleno S. Moura, Gonzalo Navarro, and Nivio Ziviani. Indexing compressed text. In Ricardo Baeza-Yates, editor, Proceedings of the Fourth Latin American Workshop on String Processing, volume 8 of International Informatics Series, pages 95-111, Valparaiso, Chile, November 1997. Carleton University Press.
19. Baruch Schieber. Computing a minimum-weight k-link path in graphs with the concave Monge property. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 405-411, San Francisco, California, 22-24 January 1995.
20. Eugene S. Schwartz. An optimum encoding with minimum longest code and total number of digits. Information and Control, 7(1):37-44, March 1964.
21. R. M. Stallman. Using and Porting GNU CC, 1995. Available at the URL http://ocean.ucc.ie/utils/manuals/gcc/gcc.ps.
22. A. Turpin and A. Moffat. Practical length-limited coding for large alphabets. The Computer Journal, 38(5):339-347, 1995.
23. Andrew Turpin. Efficient Prefix Coding. PhD thesis, University of Melbourne, Departament of Computer Science, July 1998.
24. Andrew Turpin and Alistair Moffat. Efficient implementation of the package-merge paradigm for generating length-limited codes. In Michael E. Houle and Peter Eades, editors, Proceedings of Conference on Computing: The Australian Theory Symposium, pages 187-195, Townsville, 29-30 January 1996. Australian Computer Science Communications.
25. J. van Leeuwen. On the construction of Huffman trees. In S. Michaelson and R. Milner, editors, Third International Colloquium on Automata, Languages and Programming, pages 382-410, University of Edinburgh, 20-23 July 1976. Edinburgh University Press.
26. Justin Zobel and Alistair Moffat. Adding compression to a full-text retrieval system. Software-Practice and Experience, 25(8):891-903, August 1995.