In-place calculation of minimum-redundancy codes

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

Volumn 955, Issue , 1995, Pages 393-402

  Moffat, Alistair ^a   Katajainen, Jyrki ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Data compression; Huffman code; In place algorithm; Prefix free code

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA STRUCTURES; OPTIMAL SYSTEMS;

CODEWORD LENGTH; GREEDY ALGORITHMS; GREEDY METHOD; HUFFMAN; HUFFMAN CODE; IN-PLACE ALGORITHMS; PREFIX-FREE CODES; SPACE REQUIREMENTS;

DATA COMPRESSION;

EID: 84881077182     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60220-8_79     Document Type: Conference Paper

References (10)

1. J.L. Bentley and M.D. Mcllroy. Engineering a sorting function. Software-Practice and Experience 23 (1993) 1249-1265.
2. S. Carlsson, J. Katajainen, and J. Teuhola. In-place linear probing sort. Submitted. Preliminary version appeared in Proceedings of the 9th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 577, Springer-Verlag, Berlin/Heidelberg, Germany (1992) 581-587.
3. D. Hirschberg and D. Lelewer. Efficient decoding of prefix codes. Communications of the ACM 33 (1990) 449-459.
4. D.A. Huffman. A method for the construction of minimum-redundancy codes. Proceedings of the Inst. Radio Engineers 40 (1952) 1098-1101.
5. L.L. Larmore and T.M. Przytycka. Constructing Huffman trees in parallel. SIAM Journal on Computing. To appear.
6. J. van Leeuwen. On the construction of Huffman trees. In Proceedings of the 3rd International Colloquium on Automata, Languages and Programming, Edinburgh University Press, Edinburgh, Scotland (1976) 382-410.
7. D.A. Lelewer and D.S. Hirschberg. Data compression. Computing Surveys 19 (1987) 261-296.
8. A. Moffat, A. Turpin, and J. Katajainen. Space-efficient construction of optimal prefix codes. Proceedings of the 5th IEEE Data Compression Conference, IEEE Computer Society Press, Los Alamitos, California (1995) 192-201.
9. R. Sedgewick. Algorithms in C. 2nd Edition, Addison-Wesley, Reading, Massachusetts (1990).
10. I.H. Witten, A. Moffat, and T.C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold, New York, New York (1994).