By Topic

Comments on "An inequality on guessing and its application to sequential decoding"

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
S. Boztas ; Dept. of Math., R. Melbourne Inst. of Technol., Vic., Australia

In the above paper by E. Arikan (see ibid., vol.42, no.1, p.99-105, 1996) an asymptotically tight upper bound on the /spl rho/th moment (/spl rho//spl ges/0) of the minimal number of guesses required to determine the value of a random variable was derived. We show that we can tighten this bound for the case of positive integer moments (when /spl rho/=1, the bound is improved by a factor of 2) and that the new bound also applies to a class of nonminimal guessing sequences.

Published in:

IEEE Transactions on Information Theory  (Volume:43 ,  Issue: 6 )