IPL
2010
13 years 11 months ago
2010
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
COMBINATORICS
1998
14 years 5 days ago
1998
On donnera une formule pour l’op´erateur Hqt 2 avec la propri´et´e que Hqt 2 H(2a1b)[X; q, t] = H(2a+11b)[X; q, t] avec les fonctions sym´etriques Hµ[X; q, t] = λ Kλµ(q,...
VLSID
2002
IEEE
14 years 5 months ago
2002
IEEE
A new approach to synthesizing totally symmetric Boolean functions is presented. First, a novel cellular array is introduced for synthesizing unate symmetric functions. Using this...
INDOCRYPT
2005
Springer
14 years 6 months ago
2005
Springer
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...