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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Information and Coding Theory
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
