Skip to Main content Skip to Navigation
Journal articles

On the computation of the Möbius transform

Morgan Barbier 1 Hayat Cheballah 2 Jean-Marie Le Bars 1 
1 Equipe SAFE - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
Abstract : The Möbius transform is a crucial transformation into the Boolean world; it allows to change the Boolean representation between the True Table and Algebraic Normal Form. In this work, we introduce a new algebraic point of view of this transformation based on the polynomial form of Boolean functions. It appears that we can perform a new notion: the Möbius computation variable by variable and new computation properties. As a consequence, we propose new algorithms which can produce a huge speed up of the Möbius computation for sub-families of Boolean function. Furthermore we compute directly the Möbius transformation of some particular Boolean functions. Finally, we show that for some of them the Hamming weight is directly related to the algebraic degree of specific factors.
Document type :
Journal articles
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download
Contributor : Morgan Barbier Connect in order to contact the contributor
Submitted on : Wednesday, April 15, 2020 - 5:19:41 PM
Last modification on : Saturday, June 25, 2022 - 9:55:21 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License


  • HAL Id : hal-01178356, version 3
  • ARXIV : 1507.05316


Morgan Barbier, Hayat Cheballah, Jean-Marie Le Bars. On the computation of the Möbius transform. Theoretical Computer Science, Elsevier, 2019, Theoretical Computer Science, 809, pp.171-188. ⟨hal-01178356v3⟩



Record views


Files downloads