Classification of the Z2Z4-linear Hadamard codes and their automorphism groups
Denis Krotov, Merc\`e Villanueva

TL;DR
This paper classifies Z2Z4-linear Hadamard codes of length 2^t, showing equivalence between certain classes and determining their automorphism groups, thus advancing understanding of their structure.
Contribution
It proves that all Z2Z4-linear Hadamard codes with alpha=0 are equivalent to those with alpha≠0, reducing the classification to [t/2] classes, and computes their automorphism groups.
Findings
Number of nonequivalent codes is [t/2]
All codes with alpha=0 are equivalent to those with alpha≠0
Automorphism groups' orders are explicitly given
Abstract
A -linear Hadamard code of length is a binary Hadamard code which is the Gray map image of a -additive code with binary coordinates and quaternary coordinates. It is known that there are exactly and nonequivalent -linear Hadamard codes of length , with and , respectively, for all . In this paper, it is shown that each -linear Hadamard code with is equivalent to a -linear Hadamard code with ; so there are only nonequivalent -linear Hadamard codes of length . Moreover, the order of the monomial automorphism group for the -additive Hadamard codes and the permutation automorphism group of the corresponding -linear Hadamard codes are given.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research
