摘要
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).
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 94-114 |
| 页数 | 21 |
| 期刊 | Finite Fields and their Applications |
| 卷 | 28 |
| DOI | |
| 出版状态 | 已出版 - 7月 2014 |
| 已对外发布 | 是 |
指纹
探究 'Weight distributions of cyclic codes with respect to pairwise coprime order elements' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver