Linear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions

27Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

In this paper we give an improvement of the degree of the homogeneous linear recurrence with integer coefficients that exponential sums of symmetric Boolean functions satisfy. This improvement is tight. We also compute the asymptotic behavior of symmetric Boolean functions and provide a formula that allows us to determine if a symmetric boolean function is asymptotically not balanced. In particular, when the degree of the symmetric function is a power of two, then the exponential sum is much smaller than 2n.

Cite

CITATION STYLE

APA

Castro, F. N., & Medina, L. A. (2011). Linear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions. Electronic Journal of Combinatorics, 18(2), 1–21. https://doi.org/10.37236/2004

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free