A Super-Set of Patterson-Wiedemann Functions: Upper Bounds and Possible Nonlinearities

Construction of Boolean functions on an odd number of variables with nonlinearity exceeding the bent concatenation bound is one of the most difficult combinatorial problems within the domain of Boolean functions. This problem also has deep implications in coding theory and cryptology. Patterson and Wiedemann demonstrated instances of such functions back in 1983. For more than three decades efforts have been channeled into obtaining such instances. For the first time, in this paper we explore nontrivial upper bounds on nonlinearity for such classes of functions that are invariant not only under several group actions but also for larger sets of functions than what have been considered so far. Further, we present tight upper bounds on the nonlinearity in several cases. To support our claims, we present computational results for functions on $n$ variables, where $n$ is an odd composite integer in the interval [9, 39]. In particular, our results for $n = 15$ and 21 are of immediate interest given recent resear...