Abstract
In this paper we find a canonical form decomposition for additive cyclic codes of even length over $\mathbb F_4$. This decomposition is used to count the number of such codes. We also prove that each code is the $\mathbb F_2$-span of at most two codewords and their cyclic shifts. We examine the construction of additive cyclic self-dual codes of even length and apply these results to those codes of length 24.
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.
