English

Highly nonlinear functions over finite fields

Combinatorics 2019-09-17 v2

Abstract

We consider a generalisation of a conjecture by Patterson and Wiedemann from 1983 on the Hamming distance of a function from Fqn\mathbb{F}_q^n to Fq\mathbb{F}_q to the set of affine functions from Fqn\mathbb{F}_q^n to Fq\mathbb{F}_q. We prove the conjecture for each qq such that the characteristic of Fq\mathbb{F}_q lies in a subset of the primes with density 11 and we prove the conjecture for all qq by assuming the generalised Riemann hypothesis. Roughly speaking, we show the existence of functions for which the distance to the affine functions is maximised when nn tends to infinity. This also determines the asymptotic behaviour of the covering radius of the [qn,n+1][q^n,n+1] Reed-Muller code over Fq\mathbb{F}_q and so answers a question raised by Leducq in 2013. Our results extend the case q=2q=2, which was recently proved by the author and which corresponds to the original conjecture by Patterson and Wiedemann. Our proof combines evaluations of Gauss sums in the semiprimitive case, probabilistic arguments, and methods from discrepancy theory.

Keywords

Cite

@article{arxiv.1906.11678,
  title  = {Highly nonlinear functions over finite fields},
  author = {Kai-Uwe Schmidt},
  journal= {arXiv preprint arXiv:1906.11678},
  year   = {2019}
}

Comments

17 pages, this revision contains a strengthened version of Thm. 4.1

R2 v1 2026-06-23T10:05:29.334Z