Optimal prefix-free codes for unequal letter costs: Dynamic programming with the monge property

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

Volumn 1461 LNCS, Issue , 1998, Pages 43-54

  Bradford, Phil ^a   Golin, Mordecai J ^b   Larmore, Lawrence L ^c   Rytter, Wojciech ^d,e  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c University of Nevada Las Vegas   (United States)

^d UNIVERSITY OF WARSAW   (Poland)

^e UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS);

CODE-WORDS; HUFFMAN CODING; MINIMAL COST; MONGE PROPERTY; PREFIX-FREE CODES; TIME ALGORITHMS;

DYNAMIC PROGRAMMING;

EID: 84896781741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_4     Document Type: Conference Paper

References (16)

1. Julia Abrahams, "Code and Parse Trees for Lossless Source Encoding," Sequences'97, (1997).
2. Doris Altenkamp and Kurt Mehlhorn, "Codes: Unequal Probabilities, Unequal Letter Costs," J. Assoc. Comput. Mach. 27 (3) (July 1980), 412-427.
3. A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber, Geometric applications of a matrix-searching algorithm, Algorithmica 2 (1987), pp. 195-208.
4. Siu-Ngan Choi and M. Golin, "Lopsided trees: Algorithms, Analyses and Applications," Automata, Languages and Programming, Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming (ICALP 96).
5. N. Cot, "A linear-time ordering procedure with applications to variable length encoding," Proc. 8th Annual Princeton Conference on Information Sciences and Systems, (1974), pp. 460-463.
6. E. N. Gilbert, "Coding with Digits of Unequal Costs," IEEE Trans. Inform. Theory, 41 (1995).
7. M. Golin and G. Rote, "A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes for Unequal Letter Costs," Proceedings of the 22nd International Colloquium on Automata Languages and Programming (ICALP '95), (July 1995) 256-267. Expanded version to appear in IEEE Trans. Inform. Theory.
8. Sanjiv Kapoor and Edward Reingold, "Optimum Lopsided Binary Trees," Journal of the Association for Computing Machinery 36 (3) (July 1989), 573-590.
9. R. M. Karp, "Minimum-Redundancy Coding for the Discrete Noiseless Channel," IRE Transactions on Information Theory, 7 (1961) 27-39.
10. Abraham Lempel, Shimon Even, and Martin Cohen, "An Algorithm for Optimal Prefix Parsing of a Noiseless and Memoryless Channel," IEEE Transactions on Information Theory, IT-19(2) (March 1973), 208-214.
11. L. L. Larmore, T. Przytycka, W. Rytter, Parallel computation of optimal alphabetic trees, SPAA93.
12. K. Mehlhorn, "An Efficient Algorithm for Constructing Optimal Prefix Codes," IEEE Trans. Inform. Theory, IT-26 (1980) 513-517.
13. G. Monge, Déblai et remblai, Mémoires de l' Académie des Sciences, Paris, (1781) pp. 666-704.
14. Y. Perl, M. R. Garey, and S. Even, "Efficient generation of optimal prefix code: Equiprobable words using unequal cost letters," Journal of the Association for Computing Machinery 22 (2) (April 1975), 202-214,
15. Serap A. Savari, "Some Notes on Varn Coding," IEEE Transactions on Information Theory, 40 (1) (Jan. 1994), 181-186.
16. Robert Sedgewick, Algorithms, Addison-Wesley, Reading, Mass. (1984).