Elsevier

Theoretical Computer Science

Volume 809, 24 February 2020, Pages 171-188
Theoretical Computer Science

On the computation of the Möbius transform

https://doi.org/10.1016/j.tcs.2019.12.005Get rights and content
Under an Elsevier user license
open archive

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.

Keywords

Boolean functions
Möbius transform
Butterfly algorithm

Cited by (0)