DocumentCode
1401861
Title
Comments on "An inequality on guessing and its application to sequential decoding"
Author
Boztas, Serdar
Author_Institution
Dept. of Math., R. Melbourne Inst. of Technol., Vic., Australia
Volume
43
Issue
6
fYear
1997
Firstpage
2062
Lastpage
2063
Abstract
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.
Keywords
sequential decoding; sequential estimation; asymptotically tight upper bound; guessing inequality; minimal number of guesses; nonminimal guessing sequences; positive integer moments; random variable; sequential decoding; Computational complexity; Decoding; Information theory; Mathematics; Random variables; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.641578
Filename
641578
Link To Document