192 search results - page 1 / 39 » Boolean Matching Using Generalized Reed-Muller Forms |
DAC
1994
ACM
14 years 2 months ago
1994
ACM
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
The use of error-correcting codes for tight control of the peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency-division multiplexing (OFDM) transmission is considere...
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
DATE
2007
IEEE
14 years 5 months ago
2007
IEEE
Cryptographic embedded systems are vulnerable to Differential Power Analysis (DPA) attacks. In this paper, we propose a logic design style, called as Precharge Masked Reed-Muller ...
DAC
2005
ACM
14 years 11 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...