7 search results - page 1 / 2 » List decoding tensor products and interleaved codes |
STOC
2009
ACM
14 years 5 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...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
APPROX
2007
Springer
13 years 11 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...
TWC
2008
13 years 4 months ago
2008
Space-time block codes (STBCs) from coordinate interleaved orthogonal designs (CIODs) have attracted considerable attention lately due to their full-diversity and single-symbol dec...