Some systems of diagonal equations over finite fields

DOI10.1006/FFTA.1997.0197MaRDI QIDQ1267002zbMATH OpenOpenAlexFDO

Authors Jacques Wolfmann

Publication date 8 April 1999

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/ffta.1997.0197

zbMATH Keywords

congruences in many variables systems of homogeneous diagonal equations over finite fields

Mathematics Subject Classification ID

Congruences in many variables (11D79) Polynomials over finite fields (11T06)

Review text

Let \(A=(a_{i,j})\) be an \((r\times s)\)-matrix of full rank \(r\) with entries in the finite field \(\text{GF}(q)\). For a divisor \(m\) of \(k\) put \(d:=(q^k-1)/(q^m-1)\). The author proves that the number \(N\) of solutions over \(\text{GF}(q^k)\) of the system of equations \[ a_{i,1}x_1^d+\dots +a_{i,s}x_s^d=0 \] is equal to \(Q(d),\) where \(Q(z)\) is the weight polynomial of the orthogonal complement of the linear code generated by \(A\) over \(\text{GF}(q^m)\). This is used to compute \(N\) for some special choices of the matrix \(A\), and the parameters \(s\) and \(r\).

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Some systems of diagonal equations over finite fields

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