Polynomials meeting Ax's bound

DOI10.4064/AA8405-7-2016MaRDI QIDQ2833607zbMATH OpenOpenAlexFDO

Authors Xiang-Dong Hou

Publication date 18 November 2016

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.04997

zbMATH Keywords

Gauss sumStickelberger congruenceAx's theoremKatz's theorem

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Gauss and Kloosterman sums; generalizations (11L05) Exponential sums (11T23) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: Let $finBbb{F}_q[X_1,dots,X_n]$ with $degf=d>0$ and let $Z(f)=(x_1,dots,x_n)inBbb{F}_q^n:f(x_1,dots,x_n)=0$. Ax's theorem states that $|Z(f)|equiv0pmod{q}^{lceiln/dceil-1}$, that is, $u_p(|Z(f)|)gem(lceiln/dceil-1)$, where $p=extchar,Bbb{F}_q$, $q=p^m$, and $u_p$ is the $p$-adic valuation. In this paper, we determine a condition on the coefficients of $f$ that is necessary and sufficient for $f$ to meet Ax's bound, that is, $u_p(|Z(f)|)=m(lceiln/dceil-1)$. Let $R_q(d,n)$ denote the $q$-ary Reed-Muller code $finBbb{F}_q[X_1,dots,X_n]:degfled,de{g}_{X_j}fleq-1,1lejlen$, and let $N_q(d,n;t)$ be the number of codewords of $R_q(d,n)$ with weight divisible by $p^t$. As applications of the aforementioned result, we find explicit formulas for $N_q(d,n;t)$ in the following cases: (i) $q=2^m$, $n$ even, $d=n/2$, $t=m+1$; (ii) $q=2$, $n/2ledlen-2$, $t=2$; (iii) $q=3^m$, $d=n$, $t=1$; (iv) $q=3$, $nledle2n$, $t=1$.

Recommendations

• On the weight structure of Reed-Muller codes
• On the number of solutions of polynomial systems
• A combinatorial approach to the number of solutions of systems of homogeneous polynomial equations over finite fields
• Weight polarization and divisibility
• Bounds on the number of rational points of algebraic hypersurfaces over finite fields, with applications to projective Reed-Muller codes

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 611919 (Why is no real title available?)
• A note on the proof of a theorem of Katz
• A partial improvement of the Ax-Katz theorem
• An Elementary Proof of a Theorem of Katz
• Improvements of the Chevalley-Warning and the Ax-Katz Theorems
• Improvements upon the Chevalley-Warning-Ax-Katz-type estimates
• Minimum-weight codewords as generators of generalized Reed-Muller codes
• On the weight enumeration of weights less than 2.5d of Reed—Muller codes
• The weight distribution of the third-order Reed-Muller code of length 512
• Zeroes of Polynomials Over Finite Fields
• Zeros of Functions in Finite Abelian Group Algebras

Cited in

(1)

• Weight polarization and divisibility

This page was built for publication: Polynomials meeting Ax's bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2833607)