Length-restricted coding using modified probability distributions

Proceedings - 24th Australasian Computer Science Conference, ACSC 2001

Volumn , Issue , 2001, Pages 117-124

  Liddell, M ^a   Moffat, A ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); DATA COMPRESSION; OPTIMAL SYSTEMS; REDUNDANCY;

CODEWORD; COMPRESSION TECHNIQUES; LINEAR TIME; OPTIMAL CODES; PREFIX CODES; TEXT DATABASE;

PROBABILITY DISTRIBUTIONS;

EID: 26944477970     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSC.2001.906631     Document Type: Conference Paper

References (15)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, 1975.
2. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
3. R. G. Gallager. Variations on a theme by Huffman. IEEE Transactions on Information Theory, IT-24(6):668-674, November 1978.
4. D. Harman. Overview of the second text retrieval conference (TREC-2). Information Processing & Management, 31(3):271-289, May 1995.
5. D. A. Huffman. A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Engineers, 40(9): 1098-1101, September 1952.
6. J. Katajainen, A. Moffat, and A. Turpin. A fast and space-economical algorithm for length-limited coding. In J. Staples, P. Eades, N. Katoh, and A. Moffat, editors, Proc. International Symposium on Algorithms and Computation, pages 12-21, Cairns, Australia, December 1995. Springer-Verlag. LNCS 1004.
7. L. L. Larmore and D. S. Hirschberg. A fast algorithm for optimal length-limited Huffman codes. Journal of the ACM, 37(3):464-473, July 1990.
8. R. L. Milidiú and E. S. Laber. The warm-up algorithm: A Lagrangean construction of length restricted Huffman codes. Technical Report 15, Departmento de Informática, PUC-RJ, Rio de Janeiro, Brasil, 1997. Available from ftp://ftp.learn.fplf.org.br/pub/publicacoes/.
9. R. L. Milidiú, A. A. Pessoa, and E. S. Laber. In-place length-restricted prefix coding. In Proc. of SPIRE (String Processing and Information Retrieval), pages 50-59. IEEE Computer Society, 1998.
10. R. L. Milidiú, A. A. Pessoa, and E. S. Laber. Efficient implementation of the warm-up algorithm for the construction of length-restricted prefix codes. In M. T. Goodrich and C. C. McGeoch, editors, Proc. of ALENEX (International Workshop on Algorithm Engineering and Experimentation), pages 1-17. Springer, January 1999. Notes in Computer Science, Vol. 1619.
11. A. Moffat and A. Turpin. Efficient construction of minimum-redundancy codes for large alphabets. IEEE Transactions on Information Theory, 44(4):1650-1657, July 1998.
12. R. Sedgewick. Algorithms in C. Addison Wesley, 1990.
13. A. Turpin. Efficient Prefix Coding. PhD thesis, University of Melbourne, 1998.
14. A. Turpin and A. Moffat. Efficient implementation of the package-merge paradigm for generating length-limited codes. In P. Eades and M. E. Houle, editors, Proc. CATS'96 (Computing: The Australasian Theory Symposium), pages 187-195, University of Melbourne, January 1996.
15. I. H. Witten, A. Moffat, and T. C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, San Francisco, second edition, 1999.