Designs, intersecting families and weight of boolean functions
INRIA, projet CODES
78153 Le Chesnay Cedex, France
Ecoles Militaires de Coëtquidan, DGER/CREC
56381 Guer Cedex, France
7th IMA Conference on Cryptography and Coding,
LNCS 1746, pages 70-81.
Determining the weight of Boolean functions is of exponential
complexity. By using combinatorial results, it is proved that from
their algebraic normal form (ANF), it is possible to have polynomial
time results on the weight, for some classes of functions. As a
result, the structure of the majority functions MAJ2q-1 is given.