Bounds from a Card Trick
classification
💻 cs.IT
math.IT
keywords
boundscardtrickanalysiscompressiondatadescribeentropy
read the original abstract
We describe a new variation of a mathematical card trick, whose analysis leads to new lower bounds for data compression and estimating the entropy of Markov sources.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.