Abstract
Let Fr be an extension of a finite field Fq with r=qm. Let each gi be of order ni in r* and gcd(ni,nj)=1 for 1≤i≠j≤u. We define a cyclic code over Fq byC(q,m, n1,n2,.,nu)={C(a1, a2,.,au):a1,a2,.,a u⋯Fr}, whereC(a1,a2,., au)=(Trr/q(Σi=1uaigi0),.,Trr/ q(Σi=1uaigin-1)) and n=n1 n2⋯nu. In this paper, we present a method to compute the weights of C(q,m,n1,n2,.,nu). Further, we determine the weight distributions of the cyclic codes C(q,m, n1,n2) and C(q,m,n1,n2,1).
| Original language | English |
|---|---|
| Pages (from-to) | 94-114 |
| Number of pages | 21 |
| Journal | Finite Fields and their Applications |
| Volume | 28 |
| DOIs | |
| State | Published - Jul 2014 |
| Externally published | Yes |
Keywords
- Character sums
- Cyclic codes
- Gauss periods
- Weight distribution
Fingerprint
Dive into the research topics of 'Weight distributions of cyclic codes with respect to pairwise coprime order elements'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver