Abstract
[Formula: see text]-additive codes for any integer [Formula: see text] are considered as codes over mixed alphabets. They are a generalization of binary linear codes and linear codes over [Formula: see text] In this paper, we are interested in studying [Formula: see text]-additive cyclic codes. We will give the generator polynomials of these codes. We will also give the minimal spanning sets for these codes. We will define separable [Formula: see text]-additive codes and provide conditions on the generator polynomials for a [Formula: see text]-additive cyclic code to be separable. Finally, we present some examples of optimal parameter binary codes obtained as images of [Formula: see text]-additive cyclic codes.
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.
