51 search results - page 2 / 11 » Extractors from Reed-Muller codes |
ECCC
2010
13 years 5 months ago
2010
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
VTC
2010
IEEE
13 years 4 months ago
2010
IEEE
—We analyse mobile propagation channels which occur in the context of car-to-car communications in the 24 GHz ISM band. From the information gathered, we design robust frame desi...
AAECC
1997
Springer
13 years 10 months ago
1997
Springer
Based on the notion of an order function we construct and determine the parameters of a class of error-correcting evaluation codes. This class includes the one-point algebraic geo...
FFA
2006
13 years 5 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 ...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...