Abstract
A condition is proven on the roots of the generator polynomial of a q-ary cyclic code of block length n which guarantees full cyclic order for all nonzero codewords. For such cyclic codes having n = qm − 1, a theorem is proven which allows to partition the set of all nonzero codewords into cyclic equivalence classes of order n.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
