Papers
Topics
Authors
Recent
Search
2000 character limit reached

Weight distributions of cyclic codes with respect to pairwise coprime order elements

Published 24 Jun 2013 in cs.IT and math.IT | (1306.5809v2)

Abstract: Let Fr\Bbb F_r be an extension of a finite field Fq\Bbb F_q with r=qmr=q^m. Let each gig_i be of order nin_i in Fr∗\Bbb F_r^* and gcd⁡(ni,nj)=1\gcd(n_i, n_j)=1 for 1≤i≠j≤u1\leq i \neq j \leq u. We define a cyclic code over Fq\Bbb F_q by C(q,m,n1,n2,...,nu)={c(a1,a2,...,au):a1,a2,...,au∈Fr},\mathcal C_{(q, m, n_1,n_2, ..., n_u)}=\{c(a_1, a_2, ..., a_u) : a_1, a_2, ..., a_u \in \Bbb F_r\}, where c(a1,a2,...,au)=(Trr/q(∑i=1uaigi0),...,Trr/q(∑i=1uaigin−1))c(a_1, a_2, ..., a_u)=({Tr}_{r/q}(\sum_{i=1}^ua_ig_i^0), ..., {Tr}_{r/q}(\sum_{i=1}^ua_ig_i^{n-1})) and n=n1n2...nun=n_1n_2... n_u. In this paper, we present a method to compute the weights of C(q,m,n1,n2,...,nu)\mathcal C_{(q, m, n_1,n_2, ..., n_u)}. Further, we determine the weight distributions of the cyclic codes C(q,m,n1,n2)\mathcal C_{(q, m, n_1,n_2)} and C(q,m,n1,n2,1)\mathcal C_{(q, m, n_1,n_2,1)}.

Authors (3)
Citations (111)

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.