32 search results - page 1 / 7 » Improved Nearly-MDS Expander Codes |
CORR
2006
Springer
13 years 5 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 ...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...
MICRO
2006
IEEE
13 years 11 months ago
2006
IEEE
Dynamic software bug detection tools are commonly used because they leverage run-time information. However, they suffer from a fundamental limitation, the Path Coverage Problem: t...
ISSRE
2005
IEEE
13 years 10 months ago
2005
IEEE
Code prioritization for testing promises to achieve the maximum testing coverage with the least cost. This paper presents an innovative method to provide hints on which part of co...