Paper Info
Title
Second-order capacities of erasure and list decoding
Abstract
We derive the second-order capacities (supremum of second-order coding rates) for erasure and list decoding. Fpor erasure decoding, we show that second-order capacity is √VΦ-1(εt) where V is the channel dispersion and (εt is the total error probability, i.e. the sum of the erasure and undetected errors. We show numerically that the expected rate at finite blocklength for erasures decoding can exceed the finite blocklength channel coding rate. For list decoding, we consider list codes of deterministic size 2√nl and show that the second-order capacity is l+ √VΦ-1(ε) where ε is the permissible error probability. Both coding schemes use the threshold decoder and converses are proved using variants of the meta-converse.
Year
DOI
Venue
2014
10.1109/ISIT.2014.6875161
Information Theory
Keywords
Field
DocType
block codes,channel coding,decoding,error statistics,channel dispersion,erasure decoding,finite blocklength channel coding rate,list codes,list decoding,metaconverse variants,second-order capacity,threshold decoder,undetected error probability
Discrete mathematics,Combinatorics,Sequential decoding,Communication channel,Binary erasure channel,Strassen algorithm,Decoding methods,List decoding,Erasure code,Mathematics,Erasure
Conference
Citations 
PageRank 
References 
1
0.36
8
Authors
2
Name
Order
Citations
PageRank
Vincent Yan Fu Tan149076.15
P. Moulin227034.41