Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6
Abstract
Let n1=ef+1 and n2=ef'+1 be two distinct odd primes with positive integers e,\ f,\ f'. In this paper, the two-prime Whiteman's generalized cyclotomic sequence of order e=6 is employed to construct several classes of cyclic codes over GF(q) with length n1n2. The lower bounds on the minimum distance of these cyclic codes are obtained.
0
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.