An inequality on guessing and its application to sequential decoding

Date
1995
Advisor
Instructor
Source Title
Proceedings of the International Symposium on Information Theory, IEEE 1995
Print ISSN
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
322
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
Abstract

Let (X,Y) be a pair of discrete random variables with X taking values from a finite set. Suppose the value of X is to be determined, given the value of Y, by asking questions of the form 'is X equal to x?' until the answer is 'yes'. Let G(x|y) denote the number of guesses in any such guessing scheme when X=x, Y=y. The main result is a tight lower bound on nonnegative moments of G(X|Y). As an application, lower bounds are given on the moments of computation in sequential decoding. In particular, a simple derivation of the cutoff rate bound for a single-user channels is obtained, and the previously unknown cutoff rate region of multi-access channels is determined.

Course
Other identifiers
Book Title
Keywords
Decoding, H infinity control, Random variables, Probability distribution
Citation
Published Version (Please cite this version)