Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Cyclic Codes and Sequences from a Class of Dembowski-Ostrom Functions (0902.4509v1)

Published 26 Feb 2009 in cs.IT, cs.DM, math.CO, and math.IT

Abstract: Let $q=pn$ with $p$ be an odd prime. Let $0\leq k\leq n-1$ and $k\neq n/2$. In this paper we determine the value distribution of following exponential(character) sums [\sum\limits_{x\in \bF_q}\zeta_p{\Tra_1n(\alpha x{p{3k}+1}+\beta x{pk+1})}\quad(\alpha\in \bF_{pm},\beta\in \bF_{q})] and [\sum\limits_{x\in \bF_q}\zeta_p{\Tra_1n(\alpha x{p{3k}+1}+\beta x{pk+1}+\ga x)}\quad(\alpha\in \bF_{pm},\beta,\ga\in \bF_{q})] where $\Tra_1n: \bF_q\ra \bF_p$ and $\Tra_1m: \bF_{pm}\ra\bF_p$ are the canonical trace mappings and $\zeta_p=e{\frac{2\pi i}{p}}$ is a primitive $p$-th root of unity. As applications: (1). We determine the weight distribution of the cyclic codes $\cC_1$ and $\cC_2$ over $\bF_{pt}$ with parity-check polynomials $h_2(x)h_3(x)$ and $h_1(x)h_2(x)h_3(x)$ respectively where $t$ is a divisor of $d=\gcd(n,k)$, and $h_1(x)$, $h_2(x)$ and $h_3(x)$ are the minimal polynomials of $\pi{-1}$, $\pi{-(pk+1)}$ and $\pi{-(p{3k}+1)}$ over $\bF_{pt}$ respectively for a primitive element $\pi$ of $\bF_q$. (2). We determine the correlation distribution among a family of m-sequences.

Citations (2)

Summary

We haven't generated a summary for this paper yet.