首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Highly nonlinear functions over finite fields
Institution:1. Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, T1K 3M4, Canada;2. Department of Mathematics, National Defense Academy of Japan, Yokosuka, Kanagawa, 239-8686, Japan;1. Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences, Linz, Austria;2. Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria;3. International School for Advanced Studies/Scuola Internazionale Superiore di Studi Avanzati (ISAS/SISSA), Via Bonomea 265, 34136 Trieste, Italy;1. Technology Innovation Institute, Abu Dhabi, United Arab Emirates;2. Università degli Studi di Torino, Dipartimento di Matematica, Via Carlo Alberto 10, 10123 Torino, Italy
Abstract:We consider a generalisation of a conjecture by Patterson and Wiedemann from 1983 on the Hamming distance of a function from Fqn to Fq to the set of affine functions from Fqn to Fq. We prove the conjecture for each q such that the characteristic of Fq lies in a subset of the primes with density 1 and we prove the conjecture for all q 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 n tends to infinity. This also determines the asymptotic behaviour of the covering radius of the qn,n+1] Reed-Muller code over Fq and so answers a question raised by Leducq in 2013. Our results extend the case q=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:Covering radius  Finite fields  Nonlinearity  Reed-Muller codes
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号