Home › Categories › Science & Nature› "Guessing And Entropy"

"Guessing And Entropy".pdf

BI633.pdf

🔗 Source: isiweb.ee.ethz.ch

📊 Size: 80 KB

👤 Author: Jim Massey

⬇️ Downloads: 49

Summary

The average number of successive guesses, E[G], required to correctly guess the value of a discrete random variable X is underbounded by the entropy H(X) in the manner E[G] ≥ (1/e)2^H(X) + 1, where H(X) ≥ 1 bit, and this bound is tight within a factor of 2/e when X is geometrically distributed. However, E[G] may be arbitrarily large when H(X) is an arbitrarily small positive number, indicating no interesting upper bound on E[G] in terms of H(X).

Download File

Description

The average number of successive guesses, E[G], required to correctly guess the value of a discrete random variable X is underbounded by the entropy H(X) in...

Technical Information

File Format: PDF
File Size: 80 KB
Pages: 1
Language: EN
Author: Jim Massey
Total Downloads: 49
Last Updated: 1 week ago

Document Overview

This PDF document about "Guessing and entropy" provides comprehensive information and guidance. Whether you're a beginner or advanced user, this resource offers valuable insights into "Guessing and entropy".