Exponential bounds for list size moments and error probability

We consider list decoding with a variable list size for discrete memoryless channels. We obtain simultaneous upper bounds on the error probability and the moments of list size


Presented at:
Information Theory Workshop 1998, Killarney, June 22-26, 1998
Laboratories:




 Record created 2008-08-08, last modified 2018-09-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)