Bounds from a card trick

Journal of Discrete Algorithms

Volumn 10, Issue 1, 2012, Pages 2-4

  Gagie, Travis ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Empirical entropy; Estimating entropy; Markov sources

Indexed keywords

LOWER BOUNDS; MARKOV SOURCES;

ENTROPY;

DATA COMPRESSION;

EID: 84855558392     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2011.08.001     Document Type: Article

References (16)

1. T. Batu, S. Dasgupta, R. Kumar, and R. Rubinfeld The complexity of approximating the entropy SIAM Journal on Computing 35 1 2005 132 150
2. H. Cai, S.R. Kulkarni, and S. Verdú Universal entropy estimation via block sorting IEEE Transactions on Information Theory 50 7 2004 1551 1561
3. T.M. Cover, and J.A. Thomas Elements of Information Theory 2nd edition 2006 Wiley Interscience
4. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro Compressed representations of sequences and full-text indexes ACM Transactions on Algorithms 3 2 2007
5. T. Gagie Large alphabets and incompressibility Information Processing Letters 99 6 2006 246 251 (Pubitemid 43974769)
6. T. Gagie, On the value of multiple read/write streams for data compression, in: Proceedings of the 20th Symposium on Combinatorial Pattern Matching, 2009, pp. 68-77.
7. T. Gagie, G. Manzini, Space-conscious compression, in: Proceedings of the 32nd Symposium on Mathematical Foundations of Computer Science, 2007, pp. 206-217.
8. O. Goldreich, S.P. Vadhan, On the complexity of computational problems regarding distributions (a survey), Tech. Rep. 4, Electronic Colloquium on Computational Complexity, 2011.
9. G. Manzini An analysis of the Burrows-Wheeler transform Journal of the ACM 48 3 2001 407 430
10. G. Navarro, and V. Mäkinen Compressed full-text indexes ACM Computing Surveys 39 1 2007
11. S. Raskhodnikova, D. Ron, A. Shpilka, and A. Smith Strong lower bounds for approximating distribution support size and the distinct elements problem SIAM Journal on Computing 39 3 2009 813 842
12. B. Tonkin, Math isn't just for textbooks, The Independent (August 15th, 2005).
13. P. Valiant, Testing symmetric properties of distributions, in: Proceedings of the 40th Symposium on Theory of Computing, 2008, pp. 383-392.
14. G. Valiant, P. Valiant, A CLT and tight lower bounds for estimating entropy, Tech. Rep. 179, Electronic Colloquium on Computational Complexity, 2010.
15. G. Valiant, P. Valiant, Estimating the unseen: A sublinear-sample canonical estimator of distributions, Tech. Rep. 180, Electronic Colloquium on Computational Complexity, 2010.
16. T. van Aardenne-Ehrenfest, and N.G. de Bruijn Circuits and trees in oriented linear graphs Simon Stevin 28 1951 203 217