Some cyclic codes of prime-power length
by Sudhir Batra; S.K. Arora
International Journal of Information and Coding Theory (IJICOT), Vol. 2, No. 1, 2011

Abstract: A new class of cyclic codes of length 2ⁿ over GF(q) is proposed, where q is a prime of the form 8m ± 3 and n > 3 is an integer. These codes are defined in terms of their generator polynomials. These codes have many properties analogous to those of duadic codes. Generator polynomials of some duadic codes of length pⁿ over GF(q) are also discussed, where p is an odd prime, n is an integer and q = ρ or ρ² for some prime ρ.

Online publication date: Wed, 29-Apr-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Coding Theory (IJICOT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com