Citation
Abstract
Huffman coding is often presented as the optimal solution to Twenty Questions. However, a caveat is that Twenty Questions games always end with a reply of “Yes,” whereas Huffman codewords need not obey this constraint. We bring resolution to this issue by showing that the average number of questions still lies between H(X) and H(X) + 1.
Details
- Volume
- 42-186
- Published
- August 15, 2011
- Pages
- 1–7
- File Size
- 262.8 KB