TY - JOUR
T1 - Improving the alphabet-size in high noise, almost optimal rate list decodable codes
AU - Rom, Eran
AU - Ta-Shma, Amnon
PY - 2005
Y1 - 2005
N2 - We revisit the construction of high noise, almost optimal rate list decodable code of Guruswami, Guruswami showed that if one can explicitly construct optimal extractors then one can build an explicit (1 - ε,O(1/ε)) list decodable codes of rate Ω(ε/log1/ε) and alphabet size 2O(1/ε·log1/ε). We show that if one replaces the expander component in the construction with an unbalanced disperser, then one can dramatically improve the alphabet size to 2 O(1/εlog2 1/ε) while keeping all other parameters the same.
AB - We revisit the construction of high noise, almost optimal rate list decodable code of Guruswami, Guruswami showed that if one can explicitly construct optimal extractors then one can build an explicit (1 - ε,O(1/ε)) list decodable codes of rate Ω(ε/log1/ε) and alphabet size 2O(1/ε·log1/ε). We show that if one replaces the expander component in the construction with an unbalanced disperser, then one can dramatically improve the alphabet size to 2 O(1/εlog2 1/ε) while keeping all other parameters the same.
UR - http://www.scopus.com/inward/record.url?scp=24144443421&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-31856-9_46
DO - 10.1007/978-3-540-31856-9_46
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:24144443421
SN - 0302-9743
VL - 3404
SP - 557
EP - 568
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
T2 - 22nd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2005
Y2 - 24 February 2005 through 26 February 2005
ER -