On cyclic codes of length pⁿℓ^m over a finite field
by Anuradha Sharma
International Journal of Information and Coding Theory (IJICOT), Vol. 3, No. 3, 2016

Abstract: Let p, ℓ be distinct odd primes, q be a prime power with gcd(q, p) = gcd(q, ℓ) = 1, and m, n be positive integers. In this paper, we determine all self-orthogonal and complementary-dual cyclic codes of length pⁿℓ^m over the finite field 𝔽_q with q elements. We also illustrate our results with some examples.

Online publication date: Wed, 08-Jun-2016

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