Papers
Topics
Authors
Recent
Search
2000 character limit reached

Exponential Sums, Cyclic Codes and Sequences: the Odd Characteristic Kasami Case

Published 26 Feb 2009 in cs.IT, cs.DM, math.CO, and math.IT | (0902.4508v1)

Abstract: Let q=pnq=p^n with n=2mn=2m and pp be an odd prime. Let 0≤k≤n−10\leq k\leq n-1 and k≠mk\neq m. In this paper we determine the value distribution of following exponential(character) sums [\sum\limits_{x\in \bF_q}\zeta_p{\Tra_1m (\alpha x{p{m}+1})+\Tra_1n(\beta x{pk+1})}\quad(\alpha\in \bF_{pm},\beta\in \bF_{q})] and [\sum\limits_{x\in \bF_q}\zeta_p{\Tra_1m (\alpha x{p{m}+1})+\Tra_1n(\beta x{pk+1}+\ga x)}\quad(\alpha\in \bF_{pm},\beta,\ga\in \bF_{q})] where $\Tra_1^n: \bF_q\ra \bF_p$ and $\Tra_1^m: \bF_{p^m}\ra\bF_p$ are the canonical trace mappings and ζp=e2πip\zeta_p=e^{\frac{2\pi i}{p}} is a primitive pp-th root of unity. As applications: (1). We determine the weight distribution of the cyclic codes $\cC_1$ and $\cC_2$ over $\bF_{p^t}$ with parity-check polynomials h2(x)h3(x)h_2(x)h_3(x) and h1(x)h2(x)h3(x)h_1(x)h_2(x)h_3(x) respectively where tt is a divisor of d=gcd⁡(m,k)d=\gcd(m,k), and h1(x)h_1(x), h2(x)h_2(x) and h3(x)h_3(x) are the minimal polynomials of π−1\pi^{-1}, π−(pk+1)\pi^{-(p^k+1)} and π−(pm+1)\pi^{-(p^m+1)} over $\bF_{p^t}$ respectively for a primitive element π\pi of $\bF_q$. (2). We determine the correlation distribution among a family of m-sequences. This paper extends the results in \cite{Zen Li}.

Citations (10)

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.