Linear transformation codes: codes with a compact description and transpoliser codes Online publication date: Wed, 28-Oct-2020
by Steven Dougherty; Bahattin Yildiz
International Journal of Information and Coding Theory (IJICOT), Vol. 5, No. 3/4, 2020
Abstract: In this paper we define linear transformation codes, which provides a compact description to traditional codes. We divide them into ideal codes and multiplicative codes and show that the multiplicative codes are the more useful of the two. We relate them to linear and additive codes over non-commutative rings and show how to use the canonical orthogonals in each case to construct new codes. Extending on the specific examples of centraliser and twisted centraliser codes, we define a new family of codes, which we call transpoliser codes, that can be defined over the binary field without the restrictive upper bound on the minimum distance.
Online publication date: Wed, 28-Oct-2020
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:
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 firstname.lastname@example.org