In this paper we use the covering method to compute the exact
2-divisibility of exponential sums of Boolean functions. We use these computations to improve results on the Hamming weight of deformations of Boolean
functions, and to provide criteria to obtain cosets of Reed-Muller codes with
no balanced functions.
