Huffman coding with unequal letter costs

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 785-791

  Golin, Mordecai J ^a   Kenyon, Claire ^b   Young, Neal E ^c  

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

^b UNIVERSITÉ PARIS SACLAY   (France)

^c AKAMAI TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FINITE AUTOMATA; GRAPH THEORY; POLYNOMIALS; THEOREM PROVING;

ALPHABETIC CODING; HUFFMAN CODING; POLYNOMIAL TIME ALGORITHM; POLYNOMIAL TIME APPROXIMATION SCHEME;

ENCODING (SYMBOLS);

EID: 0036040075     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/510019.510020     Document Type: Conference Paper

References (29)

1. An algorithm for optimal prefix parsing of a noiseless and memoryless channel
2. Code and parse trees for lossless source encoding
3. Codes: Unequal probabilies, unequal letter costs
4. Optimum 1-ended binary prefix codes
5. Minimum cost coding of information
6. Lopsided trees: Algorithms, analyses and applications
7. Complexity of the variable-length encoding problem
8. Simple proofs of some theorems on noiseless channels
9. How good is morse code
10. Coding with digits of unequal costs
11. A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
12. Prefix codes: Equiprobable words, unequal letter costs
13. On dichotomous search with direction-dependent costs for a uniformly hidden object
14. A method for the construction of minimum redundancy codes
15. Optimal alphabetic trees
16. Optimum lopsided binary trees
17. Minimum-redundancy coding for the discrete noiseless channel
18. Channels which transmit letters of unequal duration
19. An efficient algorithm for constructing nearly optimal prefix codes
20. Optimal prefix-free codes for unequal letter costs and dynamic programming with the monge property
21. Efficient generation of optimal prefix code: Equiprobable words using unequal cost letters
22. Binary prefix codes ending in a 1
23. The sound of silence: Guessing games for saving energy in mobile environment
24. Tree structures for optimal searching
25. Optimal variable length codes (arbitrary symbol cost and equal code word probability)