Polynomials meeting Ax's bound

Abstract: Let

f i n B b b F_{q} [X_{1}, d o t s, X_{n}]

with

d e g f = d > 0

and let

Z (f) = (x_{1}, d o t s, x_{n}) i n B b b F_{q}^{n} : f (x_{1}, d o t s, x_{n}) = 0

. Ax's theorem states that

| Z (f) | e q u i v 0 p m o d q^{l c e i l n / d c e i l - 1}

, that is,

u_{p} (| Z (f) |) g e m (l c e i l n / d c e i l - 1)

, where

p = e x t c h a r, B b b 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 (l c e i l n / d c e i l - 1)

. Let

R_{q} (d, n)

denote the

q

-ary Reed-Muller code

f i n B b b F_{q} [X_{1}, d o t s, X_{n}] : d e g f l e d, d e g_{X_{j}} f l e q - 1, 1 l e j l e n

, 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 / 2 l e d l e n - 2

,

t = 2

; (iii)

q = 3^{m}

,

d = n

,

t = 1

; (iv)

q = 3

,

n l e d l e 2 n

,

t = 1

.

Recommendations

Cites Work

Cited In (1)

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