TL;DR
This paper introduces a new variation of a mathematical card trick that provides novel lower bounds for data compression and entropy estimation of Markov sources.
Contribution
It presents a novel card trick variation that connects to fundamental problems in data compression and entropy estimation, offering new theoretical bounds.
Findings
New lower bounds for data compression
Improved entropy estimation techniques for Markov sources
Connections between card tricks and information theory
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Cellular Automata and Applications · Computability, Logic, AI Algorithms