109 search results - page 1 / 22 » Expander Codes |
CORR
2006
Springer
13 years 4 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 ...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
GLOBECOM
2009
IEEE
13 years 11 months ago
2009
IEEE
STOC
1997
ACM
13 years 9 months ago
1997
ACM
FOCS
1994
IEEE
13 years 8 months ago
1994
IEEE
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...