Abstract
Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. In this paper, let Fr be a finite field with r = qm. Suppose that g1, g2 ε F*r are not conjugates over Fq, ord(g1) = n1, ord(g2) = n2, d = gcd(n1, n2), and n = n1n2/d. Let Fq (g1) = Fqm1 , Fq(g2) = F qm2, and Ti denote the trace function from Fqmi to F q for i = 1, 2. We define a cyclic code C(q,m,n1,n2) = {c(a, b) : a ε Fqm1 , b ε dbl;Fq m2 }, where c(a, b) = (T1(ag01) + T2(bg0 2 ), T1(ag1 1) + T2(bg12), ⋯ , T 1(agn-11 ) + T2(bg n-12 )). We mainly use Gauss periods to present the weight distribution of the cyclic code C(q,m,n1,n2). As applications, we determine the weight distribution of cyclic code C(q,m,qm1-1,qm2-1) with gcd(m1, m2) = 1; in particular, it is a three-weight cyclic code if gcd(q -1, m1-m2) = 1. We also explicitly determine the weight distributions of some classes of cyclic codes including several classes of four-weight cyclic codes.
| Original language | English |
|---|---|
| Article number | 6799208 |
| Pages (from-to) | 3895-3902 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 60 |
| Issue number | 7 |
| DOIs | |
| State | Published - Jul 2014 |
| Externally published | Yes |
Keywords
- Gauss periods
- Hamming weight
- Weight distribution
- character sums
- cyclic codes