67 search results - page 2 / 14 » Information-Set Decoding for Linear Codes over Fq |
119
Voted
JCT
2006
15 years 3 months ago
2006
The van Lint-Wilson AB-method yields a short proof of the Roos bound for the minimum distance of a cyclic code. We use the AB-method to obtain a different bound for the weights of...
164
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
159
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
117
Voted
ICASSP
2011
IEEE
14 years 7 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...
110
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer