Lower bounds to moments of list size

Date
1990
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Proceedings of the IEEE International Symposium on Information Theory, ISIT 1990
Print ISSN
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
145 - 146
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
Series
Abstract

Summary form only given. The list-size random variable L for a block code is defined as the number of incorrect messages that appear to a maximum-likelihood decoder to be at least as likely as the true message. Lower bounds to the moments of L have been obtained. For sequential decoding, the results imply that the tth moment of computation is unbounded at rates above a certain value, for all t≥0, and settle a long-standing open problem.

Course
Other identifiers
Book Title
Keywords
Block codes, Maximum-likelihood decodes, Sequential decoding, Codes
Citation
Published Version (Please cite this version)