Sciweavers

Share
169 search results - page 1 / 34
» Concatenated codes can achieve list-decoding capacity
Sort
View
TIT
2008
110views more  TIT 2008»
8 years 3 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
STOC
2000
ACM
123views Algorithms» more  STOC 2000»
8 years 6 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
STOC
2009
ACM
187views Algorithms» more  STOC 2009»
9 years 3 months ago
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
Venkatesan Guruswami
TIT
2010
136views Education» more  TIT 2010»
7 years 10 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
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
8 years 4 months ago
Concatenated codes can achieve list-decoding capacity
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
books