Abstract
In this paper, we will study the structure of [Formula: see text]-additive codes where [Formula: see text] is the well-known ring of 4 elements and [Formula: see text] is the ring given by [Formula: see text], where [Formula: see text], [Formula: see text] and [Formula: see text]. We will classify all maximum distance separable codes with respect to the Singleton bound (MDSS) over [Formula: see text] Then we will focus on [Formula: see text]-additive cyclic and constacyclic codes. We will find a unique set of generator polynomials for these codes and determine minimum spanning sets for them. We will also find the generator polynomials for the dual of any [Formula: see text]-additive cyclic or constacyclic code.
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 callDisclaimer: 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.
