Classification of all \(\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8\)-additive Hadamard codes of a fixed type
Classify all \(\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8\)-additive Hadamard codes of each abstract type up to equivalence, rather than only the recursively constructed family \(H^{t_1,t_2,t_3}\).
References
All the statements of this paper therefore concern the recursively constructed family, together with the constructions already proved in to give permutation equivalent codes, and classifying all the $Z_2Z_4Z_8$-additive Hadamard codes of a given abstract type remains open.
In the same direction, the existence of $Z_4Z_8$-additive Hadamard codes, that is, the case $\alpha_1=0$, $\alpha_2\not=0$, $\alpha_3\not=0$, is still open, whereas the case $\alpha_1\not=0$, $\alpha_2=0$, $\alpha_3\not=0$ cannot occur .
First, formulas for the rank of the codes $H{t_1,\dots,t_s}$ are only known for $p=2$ and $s\in{2,3}$ . General formulas would decide the conjectures of Section 7 and Section 3. They state that the rank classifies the codes $H{t_1,\dots,t_s}$ of a given length for a fixed $s$, and that the rank and the dimension of the kernel classify all the codes of a given length.