HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Matriochka symmetric Boolean functions

Cédric Lauradoux 1 Marion Videau 2
2 CACAO - Curves, Algebra, Computer Arithmetic, and so On
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download

Contributor : Marion Videau Connect in order to contact the contributor
Submitted on : Monday, November 10, 2008 - 5:16:35 PM
Last modification on : Friday, February 4, 2022 - 3:30:29 AM
Long-term archiving on: : Monday, June 7, 2010 - 10:51:44 PM


Publisher files allowed on an open archive




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⟩



Record views


Files downloads