Lower bounds to moments of list size

Simple item page
dc.citation.epage146en_US
dc.citation.spage145en_US
dc.contributor.authorArıkan, Erdalen_US
dc.coverage.spatialSan Diego, California, USAen_US
dc.date.accessioned2016-02-08T12:02:25Zen_US
dc.date.available2016-02-08T12:02:25Zen_US
dc.date.issued1990en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionDate of Conference: 14-19 January 1990en_US
dc.descriptionConference Name: IEEE International Symposium on Information Theory, ISIT 1990en_US
dc.description.abstractSummary 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.en_US
dc.identifier.urihttp://hdl.handle.net/11693/27822en_US
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.source.titleProceedings of the IEEE International Symposium on Information Theory, ISIT 1990en_US
dc.subjectBlock codesen_US
dc.subjectMaximum-likelihood decodesen_US
dc.subjectSequential decodingen_US
dc.subjectCodesen_US
dc.titleLower bounds to moments of list sizeen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
bilkent-research-paper.pdf
Size:
68.58 KB
Format:
Adobe Portable Document Format
Download

Collections

Department of Electrical and Electronics Engineering