43 search results - page 2 / 9 » Combinatorial bounds for list decoding |
DAM
2006
13 years 6 months ago
2006
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and t...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
A generalization of the Reiger bound is presented for the list decoding of burst errors. It is then shown that Reed
TALG
2008
13 years 6 months ago
2008
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
COCOON
2009
Springer
14 years 24 days ago
2009
Springer
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy ...
CORR
2007
Springer
13 years 6 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...