2000 character limit reached
Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6
Published 20 Jul 2015 in cs.IT and math.IT | (1507.05506v3)
Abstract: Let $n_1=ef+1$ and $n_2=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 $\mathrm{GF}(q)$ with length $n_1n_2$. The lower bounds on the minimum distance of these cyclic codes are obtained.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.