Abstract
The Z2s-additive codes are subgroups of Z2sn, and can be seen as a generalization of linear codes over Z2 and Z4. A Z2s-linear Hadamard code is a binary Hadamard code which is the Gray map image of a Z2s-additive code. A partial classification of these codes by using the dimension of the kernel is known. In this paper, we establish that some Z2s-linear Hadamard codes of length 2t are equivalent, once t is fixed. This allows us to improve the known upper bounds for the number of such nonequivalent codes. Moreover, up to t=11, this new upper bound coincides with a known lower bound (based on the rank and dimension of the kernel). Finally, when we focus on s∈{2,3}, the full classification of the Z2s-linear Hadamard codes of length 2t is established by giving the exact number of such 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.
