Weight distribution of two classes of cyclic codes with respect to two distinct order elements
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. Cyclic codes have been studied for many years, but their weight distribution are known only for a few cases. In this paper, let Fr be an extension of a finite field Fq and r=qm, we determine the weight distribution of the cyclic codes C=\c(a, b): a, b ∈ Fr\, c(a, b)=( Trr/q(ag10+bg20), …, Trr/q(ag1n-1+bg2n-1)), g1, g2∈ Fr, in the following two cases: (1) (g1)=n, n|r-1 and g2=1; (2) (g1)=n, g2=g12, (g2)= n 2, m=2 and 2(r-1)n|(q+1).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.