54 search results - page 1 / 11 » Upper Bound on List-Decoding Radius of Binary Codes |
92
Voted
APPROX
2005
Springer
15 years 6 months ago
2005
Springer
A q-ary error-correcting code C ⊆ {1, 2, . . . , q}n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords o...
119
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
119
Voted
APPROX
2007
Springer
15 years 7 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
106
click to vote
DCC
2008
IEEE
16 years 11 days ago
2008
IEEE
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...
COCOON
2009
Springer
15 years 7 months 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 ...