On the computation of the Möbius transform

Morgan Barbier 1 Hayat Cheballah 1 Jean-Marie Le Bars 1
1 Equipe Monétique & Biométrie - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique 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 :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01178356
Contributor : Morgan Barbier <>
Submitted on : Monday, July 8, 2019 - 9:45:06 AM
Last modification on : Thursday, July 11, 2019 - 1:33:59 AM

File

Fast_Mobius_computation.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

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

Citation

Morgan Barbier, Hayat Cheballah, Jean-Marie Le Bars. On the computation of the Möbius transform. 2015. ⟨hal-01178356v2⟩

Share

Metrics

Record views

15

Files downloads

76