Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Exponential Sums, Nowton identities and Dickson Polynomials over Finite Fields

Published 25 Jan 2010 in cs.IT and math.IT | (1001.4305v1)

Abstract: Let F<em>q\mathbb{F}<em>{q} be a finite field, F</em>q<sup>s\mathbb{F}</em>{q<sup>s} be an extension of F<em>q\mathbb{F}<em>q, let f(x)Fq[x]f(x)\in \mathbb{F}_q[x] be a polynomial of degree nn with gcd(n,q)=1\gcd(n,q)=1. We present a recursive formula for evaluating the exponential sum </em>cF<em>q<sup>sχ<sup>(s)(f(x))\sum</em>{c\in \mathbb{F}<em>{q<sup>s}}\chi<sup>{(s)}(f(x)). Let aa and bb be two elements in Fq\mathbb{F}_q with a0a\neq 0, uu be a positive integer. We obtain an estimate for the exponential sum </em>cF<sup>q<sup>sχ<sup>(s)(ac<sup>u+bc<sup>1)\sum</em>{c\in \mathbb{F}<sup>*_{q<sup>s}}\chi<sup>{(s)}(ac<sup>u+bc<sup>{-1}), where χ<sup>(s)\chi<sup>{(s)} is the lifting of an additive character χ\chi of Fq\mathbb{F}_q. Some properties of the sequences constructed from these exponential sums are provided also.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.