Matriochka symmetric Boolean functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Matriochka symmetric Boolean functions


We present the properties of a new class of Boolean functions defined as the sum of m symmetric functions with decreasing number of variables and degrees. The choice of this construction is justified by the possibility to study these functions by using tools existing for symmetric functions. On the one hand we show that the synthesis is well understood and give an upper bound on the gate complexity. On the other hand, we investigate the Walsh spectrum of the sum of two functions and get explicit formulae for the case of degree at most three.
Fichier principal
Vignette du fichier
Lauradoux_Videau08.pdf (147.23 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

inria-00338085 , version 1 (10-11-2008)



Cédric Lauradoux, Marion Videau. Matriochka symmetric Boolean functions. IEEE International Symposium on Information Theory - ISIT 2008, Jul 2008, Toronto, Canada. pp.1631-1635, ⟨10.1109/ISIT.2008.4595264⟩. ⟨inria-00338085⟩
98 View
196 Download



Gmail Facebook Twitter LinkedIn More