140
click to vote
CODCRY
14 years 16 days ago
2011 Springer 
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
120
click to vote
CODCRY
14 years 16 days ago
2011 Springer 
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) err...
116
click to vote
CODCRY
14 years 16 days ago
2011 Springer 
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
|
Cryptology