On cyclic 𝔽q-linear 𝔽qt-codes
by Anuradha Sharma; Taranjot Kaur
International Journal of Information and Coding Theory (IJICOT), Vol. 4, No. 1, 2017

Abstract: Let 𝔽q denote the finite field of order q and characteristic p, n be a positive integer coprime to q and t ≥ 2 be an integer satisfying t ≢ 1(mod p). In this paper, we place a new trace bilinear form on 𝔽nqt , which is called the * trace bilinear form and is a generalisation of the trace inner product when q = t = 2 and Hermitian trace inner product when q is even and t = 2. We observe that it is a non-degenerate, symmetric bilinear form on 𝔽nqt for any prime power q and is alternating when q is even. We study dual codes of cyclic 𝔽q-linear 𝔽qt-codes of length n with respect to this bilinear form. We also explicitly determine bases of all the complementary-dual, self-orthogonal and self-dual cyclic 𝔽q-linear 𝔽q2-codes of length n, and enumerate all the self-orthogonal and self-dual cyclic 𝔽q-linear 𝔽qt-codes of length n. Besides this, by placing ordinary and Hermitian trace inner products on 𝔽nq2, we determine bases of all the complementary-dual cyclic 𝔽q-linear 𝔽q2-codes of length n.

Online publication date: Mon, 09-Jan-2017

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