Sciweavers

3 search results - page 1 / 1
» Universal decoding with an erasure option
Sort
View
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 5 months ago
A Neyman-Pearson Approach to Universal Erasure and List Decoding
When information is to be transmitted over an unknown, possibly unreliable channel, an erasure option at the decoder is desirable. Using constant-composition random codes, we propo...
Pierre Moulin
CORR
2006
Springer
111views Education» more  CORR 2006»
13 years 4 months ago
Universal decoding with an erasure option
Motivated by applications of rateless coding, decision feedback, and automatic repeat request (ARQ), we study the problem of universal decoding for unknown channels in the presence...
Neri Merhav, Meir Feder
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 4 months ago
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
Neri Merhav