arXiv subjects
Publications and source records attributed to Elodie Leducq.
In this paper, we study the third weight of generalized Reed-Muller codes. We prove under some restrictive condition that the third weight of generalized Reed-Muller codes depends on the third weight of generalized Reed-Muller codes of small order with two variables. In some cases, we are able to determine the third weight and the third weight codewords of generalized Reed-Muller codes.
In this paper we give the second weight codewords of the generalized Reed-Muller code of order r and length $q^m$.
Let $p$ be an odd prime number. We prove that for $m\equiv1\mod p$, $x^m$ is perfectly nonlinear over $\mathbb{F}_{p^n}$ for infinitely many $n$ if and only if $m$ is of the form $p^l+1$, $l\in\mathbb{N}$. First, we study singularities of $f(x,y)=\frac{(x+1)^m-x^m-(y+1)^m+y^m}{x-y}$ and we use Bezout theorem to show that for $m\neq 1+p^l$, $f(x,y)$ has an absolutely irreducible factor. Then by Weil theorem, f(x,y) has rationnal points such that $x\neq y$ which means that $x^m$ is not PN.
Dobbertin, Mills, Müller, Pott and Willems conjecture that two families of power mapping are families of APN functions. Here we prove those two conjectures.
We generalize to any q a theorem about covering radius of linear codes proved by Helleseth, Klove and Mykkelvit. Then we determine the covering radius of first order generalized Reed-Muller codes in second order generalized Reed-Muller codes. Using these results, we are able to give bounds for the covering radius of first order generalized Reed-Muller codes. Finaly, using Magma, we get some improvements for q=3.
We give a new proof of Delsarte, Goethals and Mac williams theorem on minimal weight codewords of generalized Reed-Muller codes published in 1970. To prove this theorem, we consider intersection of support of minimal weight codewords with affine hyperplanes and we proceed by recursion.