Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

The weight distribution of a family of p-ary cyclic codes

Published 21 May 2014 in cs.IT and math.IT | (1405.5278v1)

Abstract: Let m, k be positive integers, p be an odd prime and π\pi be a primitive element of Fpm\mathbb{F}_{p^m}. In this paper, we determine the weight distribution of a family of cyclic codes Ct\mathcal{C}_t over Fp\mathbb{F}_p, whose duals have two zeros π−t\pi^{-t} and −π−t-\pi^{-t}, where tt satisfies t≡pk+12pτ (mod pm−12)t\equiv \frac{p^k+1}{2}p^\tau \ ({\rm mod}\ \frac{p^m-1}{2}) for some τ∈{0,1,⋯ ,m−1}\tau \in \{0,1,\cdots, m-1\}.

Authors (2)
Citations (14)

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.