Compressing probability distributions

Information Processing Letters

Volumn 97, Issue 4, 2006, Pages 133-137

  Gagie, Travis ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Data compression; Data structures

Indexed keywords

DATA COMPRESSION; DATA STRUCTURES; ENTROPY; QUERY LANGUAGES; TREES (MATHEMATICS);

ASSYMETRIC COMMUNICATION; HUFFMAN TREE; RELATIVE ENTROPY;

PROBABILITY DISTRIBUTIONS;

EID: 29344456164     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.10.006     Document Type: Article

References (15)

1. M. Adler, and B.M. Maggs Protocols for asymmetric communication channels J. Comput. System Sci. 63 2001 573 596
2. D. Bellot, P. Bessière, Approximate discrete probability distribution representation using a multi-resolution binary tree, in: Proc. 15th Internat. Conf. on Tools with Artificial Intelligence, 2003, pp. 498-503
3. D. Chen, Y.-J. Chiang, N. Memon, X. Wu, Optimal alphabet partitioning for semi-adaptive coding of sources of unknown sparse distributions, in: Proc. of the Data Compression Conf., 2003, pp. 372-381
4. T. Cover, and J. Thomas Elements of Information Theory 1991 Wiley New York
5. T. Gagie, Dynamic asymmetric communication, submitted for publication
6. D.A. Huffman A method for the construction of minimum redundancy codes Proc. IERE 40 9 1952 1098 1101
7. H.V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. Sevcik, T. Suel, Optimal histograms with quality guarantees, in: Proc. 24th Internat. Conf. on Very Large Databases, 1998, pp. 275-286
8. M.M. Klawe, and B. Mumey Upper and lower bounds on constructing alphabetic binary trees SIAM J. Discrete Math. 8 1995 638 651
9. L.G. Kraft, A device for quantizing, grouping, and coding amplitude-modulated pulses, Master's thesis, Massachusetts Institute of Technology, 1949
10. S. Kullback, and R.A. Leibler On information and sufficiency Ann. Math. Statistics 22 1951 79 86
11. G. Longo, and G. Galasso An application of informational divergence to Huffman codes IEEE Trans. Inform. Theory 28 1 1982 36 43
12. K. Mehlhorn A best possible bound for the weighted path length of binary search trees SIAM J. Comput. 6 1977 235 239
13. J.I. Munro, and V. Raman Succinct representation of balanced parentheses and static trees SIAM J. Comput. 31 2001 762 776
14. D. Sheinwald, On binary alphabetical codes, in: Proc. of the IEEE Data Compression Conf., 1992, pp. 112-121
15. C. Ye, and R.W. Yeung A simple upper bound on the redundancy of Huffman codes IEEE Trans. Inform. Theory 48 7 2002 2132 2138