Repeated-root bidimensional (μ, ν)-constacyclic codes of length 4p^t.2^r
by Shikha Patel; Om Prakash
International Journal of Information and Coding Theory (IJICOT), Vol. 5, No. 3/4, 2020

Abstract: Let p be an odd prime. The main concern of this article is to study all the repeated-root bidimensional (μ, ν)-constacyclic codes of length 4p^t.2^r over the finite field 𝔽_p^m. Here, we provide all the self-dual repeated-root bidimensional (1, 1)-constacyclic and (−1, 1)-constacyclic codes of length 4p^t.2^r over 𝔽_p^m. We also discuss the repeated-root bidimensional (η, 1)-constacyclic codes of length 4p^t.2^r over 𝔽_p^m. Moreover, it has been shown that these structures are useful in the construction of linear complementary dual (LCD) codes and self-dual codes. As an example, we are listed all the repeated-root bidimensional (μ, ν)-constacyclic codes of length 72 over the finite field 𝔽₂₇.

Online publication date: Wed, 28-Oct-2020

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