2000 character limit reached
On Binary Cyclic Codes with Five Nonzero Weights (0904.2237v1)
Published 15 Apr 2009 in cs.IT, cs.DM, math.CO, and math.IT
Abstract: Let $q=2n$, $0\leq k\leq n-1$, $n/\gcd(n,k)$ be odd and $k\neq n/3, 2n/3$. In this paper the value distribution of following exponential sums [\sum\limits_{x\in \bF_q}(-1){\mathrm{Tr}_1n(\alpha x{2{2k}+1}+\beta x{2k+1}+\ga x)}\quad(\alpha,\beta,\ga\in \bF_{q})] is determined. As an application, the weight distribution of the binary cyclic code $\cC$, with parity-check polynomial $h_1(x)h_2(x)h_3(x)$ where $h_1(x)$, $h_2(x)$ and $h_3(x)$ are the minimal polynomials of $\pi{-1}$, $\pi{-(2k+1)}$ and $\pi{-(2{2k}+1)}$ respectively for a primitive element $\pi$ of $\bF_q$, is also determined.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.