Sciweavers

93 search results - page 1 / 19
» List decoding algorithms for certain concatenated codes
Sort
View
STOC
2000
ACM
123views Algorithms» more  STOC 2000»
13 years 11 months ago
List decoding algorithms for certain concatenated codes
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...
Venkatesan Guruswami, Madhu Sudan
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
14 years 1 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
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...
Venkatesan Guruswami, Atri Rudra
CATS
2007
13 years 9 months ago
Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate
d Abstract) Tomoyuki Yamakami Department of Computer Software, University of Aizu 90 Kami-Iawase, Tsuruga, Ikki-machi, Fukushima 965-8580, Japan Our task of quantum list decoding ...
Tomoyuki Yamakami
TIT
2008
110views more  TIT 2008»
13 years 7 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
TIT
2010
136views Education» more  TIT 2010»
13 years 2 months ago
The existence of concatenated codes list-decodable up to the hamming bound
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...
Venkatesan Guruswami, Atri Rudra