67 search results - page 1 / 14 » Information-Set Decoding for Linear Codes over Fq |
PQCRYPTO
2010
13 years 8 months ago
2010
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...
CODCRY
2011
Springer
12 years 8 months 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...
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
FFA
2006
13 years 4 months ago
2006
We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also ...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— Most of the existing works on space-time block codes (STBC) assume the channels are quasi-static, i.e., they remain invariant within one block. This assumption is not always tr...