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 GF(q) with length n 1 n 2 . The lower bounds on the minimum distance of these cyclic codes are obtained.
Let p be a prime number. In this paper, we study cyclic codes over the ring Z p [u, v]/ u 2 , v 2 , uv − vu . We find a unique set of generators for these codes. We also study the rank and the Hamming distance of these codes. We obtain all except one ternary optimal code of length 12 as the Gray image of the cyclic codes over the ring Z p [u, v]/ u 2 , v 2 , uv − vu .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.