34 search results - page 1 / 7 » Linear-time encodable and decodable error-correcting codes |
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
STACS
2009
Springer
14 years 5 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
FOCS
1995
IEEE
14 years 2 months ago
1995
IEEE
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...