Abstract
In this paper, the two-prime Whiteman’s generalized cyclotomic sequences of order 2r, r ≥ 2, are employed to construct several classes of cyclic codes over the finite field GF(q) with length n1n2. The lower bounds of the minimum distance of these cyclic codes are obtained.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
