199 search results - page 3 / 40 » Linear time encodable and list decodable codes |
STOC
2010
ACM
14 years 4 months ago
2010
ACM
FOCS
2002
IEEE
14 years 9 days ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
TIT
2008
13 years 7 months ago
2008
Let a biorthogonal Reed
TIT
2002
13 years 7 months ago
2002
Abstract--Informally, an error-correcting code has "nice" listdecodability properties if every Hamming ball of "large" radius has a "small" number of ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...