3 search results - page 1 / 1 » A Neyman-Pearson Approach to Universal Erasure and List Deco... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
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...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
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...
TIT
2010
13 years 1 days ago
2010
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...