831 search results - page 4 / 167 » Parallel error correcting codes |
123
click to vote
FOCS
1994
IEEE
15 years 6 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 ...
CORR
2006
Springer
15 years 2 months ago
2006
Springer
In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. Using this new concept, we derive proper...
TIT
1998
15 years 1 months ago
1998
In a typical burst-error correction application of a product code of nv nh arrays, one uses an [nh; nh rh] code Ch that detects corrupted rows, and an [nv; nv rv] code Cv that is...
113
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A construction using the E8 lattice and Reed-Solomon codes for error-correction in flash memory is given. Since E8 lattice decoding errors are bursty, a Reed-Solomon code over GF(2...
123
click to vote
TIT
2008
15 years 2 months ago
2008
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...