This paper presents a study of perturbations of symmetric Boolean functions. In particular, it
establishes a connection between exponential sums of these perturbations and Diophantine …

It has been known since 1996 (work of Cai et al.) that the sequence of Hamming weights {wt
(fn (x 1,…, xn))}, where fn is a symmetric Boolean function of degree d in n variables …

This work brings techniques from the theory of recurrent integer sequences to the problem of
balancedness of symmetric Boolean functions. In particular, the periodicity modulo p (p odd …

New families of balanced symmetric functions and a generalization of Cusick, Li and Stǎnicǎ’s
conjecture | SpringerLink Skip to main content Advertisement SpringerLink Log in Menu Find a …

Boolean functions have important applications in information technology and computer
science. Certificate complexity is an important combinatorial measure of Boolean function …

Boolean functions have important applications in molecular regulatory networks,
engineering, cryptography, information technology, and computer science. Symmetric …

In this paper we extend the covering method for computing the exact 2-divisibility of
exponential sums of Boolean functions, improve results on the divisibility of the Hamming …

Today's era can be characterized by the rise of computer technology. Computers have been,
to some extent, responsible for the explosion of the scientific knowledge that we have today …

In this work we present two studies related to exponential sums and Walsh transformations
of q-ary functions. In our first study we establish the asymptotic behavior of some generating …

In this paper we extend the covering method for computing the exact 2-divisibility of
exponential sums of Boolean functions, improve results on the divisibility of the Hamming …