We introduce a tensor transform for Boolean functions that covers the algebraic normal and Walsh transforms but which also allows for the definition of new, probabilistic and weight transforms, relating a function to its bias polynomial and to the weights of its subfunctions respectively. Our approach leads to easy proofs for some known results and to new properties of the aforecited transforms. Finally, we present a new probabilistic characteristic of a Boolean function that is defined by its algebraic normal and probabilistic transforms over the reals.
|Name||Lecture Notes in Computer Science|
|Conference||conference; ICICS 2002, Singapore; 2002-12-09; 2002-12-12|
|Period||9/12/02 → 12/12/02|
|Other||ICICS 2002, Singapore|