Card Trick Leads to New Bound on Data Compression (2010)
technologyreview.com
technologyreview.com
What bound did they break? By how much? In what domain does the bound apply?
(There is no one "compression bound" for lossless compression; there exist infinitely many lossless compression schemes which can compress at least one sequence of arbitrary length to a single bit, and every lossless compression scheme must have an expected compression ratio over all data of 1:1. Hence knowing the domain constraints is important!)
In this case, however the original paper (already linked in the HN comments) is itself a linkbaity title with content-free abstract.
No reference, No Paper not even an example of how it applies. I hope an editor notices it and they pull it out - pretty embarrassing.
At the bottom of the article
$infile = $ARGS[1]
$outfile = $ARGS[2]
touch $outfile
This was one of my favorite examples in Data Structures and Algorithms in college.He knew the most important part of any act is showmanship, and he knew that performing well at top-level magic contests required both showmanship and less known tricks, tricks that an expert audience wouldn't be able to puzzle out quickly or easily.
It took him weeks (months? been a while since I read the book) to memorize the sequence of cards in his prepared deck (sequence generated by computer) and weeks (months?) more to go from being to do the trick to being able to perform the trick.
It's a good read - and what I just described only comes in at the end, after his intense and occasionally life threatening research into the world of magic.
Does that mean that the paper was accepted, or was rejected 4 years ago and never published?
A four digit key will yield a 10003 digit de Bruijn sequence so if you push 2.5 keys/s it will take you at most 7 hours to hit the correct key. Doing all keys in sequence 0000, 0001, ..., 9999 will take you at most 28 hours.
Did I find the code? Yes, I asked the neighbor.