English

Cyclic Codes and Sequences from a Class of Dembowski-Ostrom Functions

Information Theory 2009-02-27 v1 Discrete Mathematics Combinatorics math.IT

Abstract

Let q=pnq=p^n with pp be an odd prime. Let 0kn10\leq k\leq n-1 and kn/2k\neq n/2. In this paper we determine the value distribution of following exponential(character) sums x\bFqζp\Tra1n(αxp3k+1+βxpk+1)(α\bFpm,β\bFq)\sum\limits_{x\in \bF_q}\zeta_p^{\Tra_1^n(\alpha x^{p^{3k}+1}+\beta x^{p^k+1})}\quad(\alpha\in \bF_{p^m},\beta\in \bF_{q}) and x\bFqζp\Tra1n(αxp3k+1+βxpk+1+\gax)(α\bFpm,β,\ga\bFq)\sum\limits_{x\in \bF_q}\zeta_p^{\Tra_1^n(\alpha x^{p^{3k}+1}+\beta x^{p^k+1}+\ga x)}\quad(\alpha\in \bF_{p^m},\beta,\ga\in \bF_{q}) where \Tra1n:\bFq\ra\bFp\Tra_1^n: \bF_q\ra \bF_p and \Tra1m:\bFpm\ra\bFp\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 \cC1\cC_1 and \cC2\cC_2 over \bFpt\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(n,k)d=\gcd(n,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 π(p3k+1)\pi^{-(p^{3k}+1)} over \bFpt\bF_{p^t} respectively for a primitive element π\pi of \bFq\bF_q. (2). We determine the correlation distribution among a family of m-sequences.

Cite

@article{arxiv.0902.4509,
  title  = {Cyclic Codes and Sequences from a Class of Dembowski-Ostrom Functions},
  author = {Jinquan Luo and San Ling and Chaoping Xing},
  journal= {arXiv preprint arXiv:0902.4509},
  year   = {2009}
}
R2 v1 2026-06-21T12:15:44.792Z