Highly nonlinear functions over finite fields

We consider a generalisation of a conjecture by Patterson and Wiedemann from 1983 on the Hamming distance of a function from ${\mathbb{F}}_q^n$ to ${\mathbb{F}}_q$ to the set of affine functions from ${\mathbb{F}}_q^n$ to ${\mathbb{F}}_q$. We prove the conjecture for each q such that the characteristic of ${\mathbb{F}}_q$ 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 $[q^n,n+1]$ Reed-Muller code over ${\mathbb{F}}_q$ 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.     

Tight wavelet frame sets in finite vector spaces

Let $q\ge 2$ be an integer, and ${\mathbb{F}}_q^d$, $d\ge 1$, be the vector space over the cyclic space ${\mathbb{F}}_q$. The purpose of this paper is two-fold. First, we obtain sufficient conditions on $E?{\mathbb{F}}_q^d$ such that the inverse Fourier transform of $1_E$ generates a tight wavelet frame in $L^2({\mathbb{F}}_q^d)$. We call these sets (tight) wavelet frame sets. The conditions are given in terms of multiplicative and translational tilings, which is analogous with Theorem 1.1 ([20]) by Wang in the setting of finite fields. In the second part of the paper, we exhibit a constructive method for obtaining tight wavelet frame sets in ${\mathbb{F}}_q^d$, $d\ge 2$, q an odd prime and $q\equiv 3$ (mod 4).     

Fq-linear codes over Fq-algebras

Huffman (2013) [12] studied ${\mathbb{F}}_q$-linear codes over ${\mathbb{F}}_{q^m}$ and he proved the MacWilliams identity for these codes with respect to ordinary and Hermitian trace inner products. Let S be a finite commutative ${\mathbb{F}}_q$-algebra. An ${\mathbb{F}}_q$-linear code over S of length n is an ${\mathbb{F}}_q$-submodule of $S^n$. In this paper, we study ${\mathbb{F}}_q$-linear codes over S. We obtain some bounds on minimum distance of these codes, and some large classes of MDR codes are introduced. We generalize the ordinary and Hermitian trace products over ${\mathbb{F}}_q$-algebras and we prove the MacWilliams identity with respect to the generalized form. In particular, we obtain Huffman's results on the MacWilliams identity. Among other results, we give a theory to construct a class of quantum codes and the structure of ${\mathbb{F}}_q$-linear codes over finite commutative graded ${\mathbb{F}}_q$-algebras.     

Self-reciprocal and self-conjugate-reciprocal irreducible factors of xn − λ and their applications

In this paper, we present some necessary and sufficient conditions under which an irreducible polynomial is self-reciprocal (SR) or self-conjugate-reciprocal (SCR). By these characterizations, we obtain some enumeration formulas of SR and SCR irreducible factors of $x^n-\lambda$, $\lambda \in {\mathbb{F}}_q^{⁎}$, over ${\mathbb{F}}_q$, which are just open questions posed by Boripan et al. (2019). We also count the numbers of Euclidean and Hermitian LCD constacyclic codes and show some well-known results on Euclidean and Hermitian self-dual constacyclic codes in a simple and direct way.     

Permutation binomials of the form xr(xq−1 + a) over Fqe

We present several existence and nonexistence results for permutation binomials of the form $x^r(x^{q-1}+a)$, where $e\ge 2$ and $a\in {\mathbb{F}}_{q^e}^{⁎}$. As a consequence, we obtain a complete characterization of such permutation binomials over ${\mathbb{F}}_{q^2}$, ${\mathbb{F}}_{q^3}$, ${\mathbb{F}}_{q^4}$, ${\mathbb{F}}_{p^5}$, and ${\mathbb{F}}_{p^6}$, where p is an odd prime.     

Weight distributions of generalized quasi-cyclic codes over Fq+uFq

In this paper, by Gauss sums, we determine Hamming weight distributions of generalized quasi-cyclic (GQC) codes over the finite chain ring ${\mathbb{F}}_q+u{\mathbb{F}}_q$, where $u^2=0$. As applications, some new infinite families of minimal linear codes with $\frac{W_{\min }}{W_{\max }}\le \frac{q-1}{q}$ and projective two-weight codes are constructed.