Large alphabets and incompressibility

Information Processing Letters

Volumn 99, Issue 6, 2006, Pages 246-251

  Gagie, Travis ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Analysis of algorithms; Birthday paradox; Data compression; de Bruijn sequences; Empirical entropy; Kolmogorov complexity; Markov processes; Normal numbers; Relative entropy; Self information; Shannon's entropy; Threshold phenomena

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; ENTROPY; MARKOV PROCESSES; THRESHOLD ELEMENTS;

ANALYSIS OF ALGORITHMS; BIRTHDAY PARADOX; DE BRUIJN SEQUENCES; EMPIRICAL ENTROPY; KOLMOGOROV COMPLEXITY; NORMAL NUMBERS; RELATIVE ENTROPY; SELF-INFORMATION; SHANNON'S ENTROPY; THRESHOLD PHENOMENA;

NUMBER THEORY;

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

References (24)

1. Becher V., and Figueira S. An example of a computable absolutely normal number. Theoretical Computer Science 270 (2002) 947-958
2. Borel E. Les probabilités dénombrables et leur applications arithmétiques. Rendiconti del Circolo Matematico di Palermo 27 (1909) 247-271
3. M. Burrows, D.J. Wheeler, A block-sorting lossless data compression algorithm, Technical Report 24, Digital Equipment Corporation, 1994
4. Chaitin G.J. On the length of programs for computing finite binary sequences: Statistical considerations. Journal of the ACM 16 (1969) 145-159
5. Champernowne D.G. The construction of decimals normal in the scale of 10. Journal of the London Mathematical Society 8 (1933) 254-260
6. Copeland A.H., and Erdös P. Note on normal numbers. Bulletin of the American Mathematical Society 52 (1946) 857-860
7. de Bruijn N.G. A combinatorial problem. Koninklijke Nederlandse Akademie van Wetenschappen 49 (1946) 758-764
8. P. Ferragina, G. Manzini, V. Mäkinen, G. Navarro, Compressed representations of sequences and full-text indexes, ACM Transactions on Algorithms, submitted for publication
9. Gagie T. Compressing probability distributions. Information Processing Letters 97 (2006) 133-136
10. R. Grossi, A. Gupta, J.S. Vitter, An algorithmic framework for compression and text indexing, submitted for publication
11. Hagerup T., and Rüb C. A guided tour of Chernoff bounds. Information Processing Letters 33 (1990) 305-308
12. Kalai G., and Safra S. Threshold phenomena and influence. In: Percus A.G., Istrate G., and Moore C. (Eds). Computational Complexity and Statistical Physics (2006), Oxford University Press, Oxford
13. Kolmogorov A.N. Three approaches to the quantitative definition of information. Problems in Information Transmission 1 (1965) 1-7
14. Kullback S., and Leibler R.A. On information and sufficiency. Annals of Mathematical Statistics 22 (1951) 79-86
15. Li M., and Vitányi P. An Introduction to Kolmogorov Complexity and its Applications. second ed. (1997), Springer-Verlag, Berlin
16. Manzini G. An analysis of the Burrows-Wheeler Transform. Journal of the ACM 48 (2001) 407-430
17. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press, Cambridge
18. Munro J.I., and Spira P.M. Sorting and searching in multisets. SIAM Journal on Computing 5 (1976) 1-8
19. Rosenfeld V.R. Enumerating De Bruijn sequences. MATCH Communications in Mathematical and in Computer Chemistry 45 (2002) 71-83
20. Shannon C.E. A mathematical theory of communication. Bell System Technical Journal 27 (1948) 379-423 623-656
21. Sierpinski M.W. Démonstration élémentaire du théorème de M. Borel sur les nombres absolument normaux et détermination d'un tel nombre. Bulletin de la Société Mathématiques de France 45 (1917) 127-132
22. Sleator D.D., and Tarjan R.E. Self-adjusting binary search trees. Journal of the ACM 32 (1985) 652-686
23. Solomonoff R.J. A formal theory of inductive inference. Information and Control 7 (1964) 1-22 224-254
24. Turing A.M. A note on normal numbers. In: Britton J.L. (Ed). Collected Works of A.M. Turing: Pure Mathematics (1992), North-Holland, Amsterdam 117-119