LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Diophantine Equations With Binomial Coefficients and Perturbations of Symmetric Boolean Functions

Photo by saadahmad_umn from unsplash

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 equations of the form $\sum… Click to show full abstract

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 equations of the form $\sum _{l=0}^{n} \binom {n}{l} x_{l}=0$ , where $x_{j}$ belongs to some fixed bounded subset $\Gamma $ of $\mathbb {Z}$ . The concepts of trivially balanced symmetric Boolean function and sporadic balanced Boolean function are extended to this type of perturbations. An observation made by Canteaut and Videau for symmetric Boolean functions of fixed degree is extended. To be specific, it is proved that, excluding the trivial cases, balanced perturbations of fixed degree do not exist when the number of variables grows. Some sporadic balanced perturbations are presented. Finally, a beautiful but unexpected identity between exponential sums for perturbations of two different symmetric Boolean functions is also included in this work.

Keywords: tex math; symmetric boolean; boolean functions; inline formula

Journal Title: IEEE Transactions on Information Theory
Year Published: 2018

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.