Guesswork and Entropy

Malone, David and Sullivan, Wayne G. (2004) Guesswork and Entropy. IEEE Transactions on Information Theory, 50 (3). pp. 525-526. ISSN 0018-9448

[img] Download (80kB)
Official URL:

Share your research

Twitter Facebook LinkedIn GooglePlus Email more...

Add this article to your Mendeley library


Abstract—We derive the moments of the guesswork, the number of attempts required to correctly guess the output of a random source, for a source determined by a Markov chain via a large deviations type estimate. These moments are related to the Perron–Frobenius eigenvalue of the matrix formed by element-wise powers of the Markov chain’s transition matrix.

Item Type: Article
Additional Information: Copyright Notice "©2004 IEEE. Reprinted from IEEE Transactions on Information Theory. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE."
Keywords: Markov processes; Eigenvalues and eigenfunctions; Entropy; Matrix algebra; Markov chain transition matrix; Perron-Frobenius eigenvalue; Renyi entropy; Deviation; Estimation; Element-wise power; Guesswork; Matrix formation.
Academic Unit: Faculty of Science and Engineering > Computer Science
Faculty of Science and Engineering > Research Institutes > Hamilton Institute
Item ID: 1462
Identification Number: 10.1109/TIT.2004.824921
Depositing User: Dr. David Malone
Date Deposited: 30 Jun 2009 16:45
Journal or Publication Title: IEEE Transactions on Information Theory
Publisher: IEEE
Refereed: Yes

Repository Staff Only(login required)

View Item Item control page

Document Downloads

More statistics for this item...