Nonlinearity of a Boolean function with odd number of input bits
This is a famous open problem in coding theory, the covering radius of the first order Reed-Muller code, when the number of variables is odd.
As far as I know the best general upper bound on nonlinearity which in this paper is denoted N (=covering radius R) for $n=2k+1$ is still the one below: