Sciweavers

199 search results - page 2 / 40
» Linear time encodable and list decodable codes
Sort
View
FOCS
1995
IEEE
13 years 9 months ago
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
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. ...
Noga Alon, Jeff Edmonds, Michael Luby
ICASSP
2011
IEEE
12 years 9 months ago
Linear time decoding of real-field codes over high error rate channels
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...
Zaixing He, Takahiro Ogawa, Miki Haseyama
CIKM
2011
Springer
12 years 5 months ago
SIMD-based decoding of posting lists
Powerful SIMD instructions in modern processors offer an opportunity for greater search performance. In this paper, we apply these instructions to decoding search engine posting ...
Alexander A. Stepanov, Anil R. Gangolli, Daniel E....
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
13 years 11 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra