2013/06/22 by Chengju Li, Qin Yue, Li, Chengju +1 · 1 citation
Computer Science · Mathematics · #11T24 #11T71 #94B15 #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT) #cs.IT #math.IT #math.NT #msc:11T24 #msc:11T71 #msc:94B15
paper · pdf · doi:10.48550/arxiv.1306.5277
arxiv created 2013/06/22 · arxiv updated 2013/06/25
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. Cyclic codes have been studied for many years, but their weight distribution are known only for a few cases. In this paper, let \Bbb Fr be an extension of a finite field \Bbb Fq and r=qm, we determine the weight distribution of the cyclic codes \mathcal C=\c(a, b): a, b ∈ \Bbb Fr\, c(a, b)=(\mbox Trr/q(ag10+bg20), …, \mbox Trr/q(ag1n-1+bg2n-1)), g1, g2∈ \Bbb Fr, in the following two cases: (1) \ord(g1)=n, n|r-1 and g2=1; (2) \ord(g1)=n, g2=g12, \ord(g2)=\frac n 2, m=2 and \frac2(r-1)n|(q+1).