arXiv:1011.4609cs.IT
Bounds from a Card Trick
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.
On Hacker News
Linked by 2 identifiable commenters in 2 comments across 1 thread, from Aug 2014 to Aug 2014.
Discussed in comments1 thread
Submitted to Hacker News
Also discussed alongside
Connected through shared HN threads, not inferred similarity or a recommendation.
The actual paper with the theorems: http://arxiv.org/abs/1011.4609
derf_View on HNParent context
> Ref: arxiv.org/abs/1011.4609 Bounds from a Card Trick At the bottom of the article
grkvltView on HNParent context