$\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-Additive Hadamard Codes
Dipak K. Bhunia, Cristina Fern\'andez-C\'ordoba, Merc\`e Villanueva

TL;DR
This paper extends the theory of additive Hadamard codes over mixed rings to the $bZ_2bZ_4bZ_8$ setting, providing recursive constructions and showing these codes are distinct from previously known classes.
Contribution
It introduces a recursive construction method for $bZ_2bZ_4bZ_8$-additive Hadamard codes and demonstrates their uniqueness compared to other linear Hadamard codes.
Findings
Recursive construction of $bZ_2bZ_4bZ_8$-additive Hadamard codes.
$bZ_4$, $bZ_8$, and $bZ_2bZ_4$-linear codes are not subsets of the $bZ_2bZ_4bZ_8$-linear codes.
Nonlinear $bZ_2bZ_4bZ_8$-linear Hadamard codes of length $2^{11}$ are inequivalent to other known classes.
Abstract
The -additive codes are subgroups of , and can be seen as linear codes over when , -additive or -additive codes when or , respectively, or -additive codes when . A -linear Hadamard code is a Hadamard code which is the Gray map image of a -additive code. In this paper, we generalize some known results for -linear Hadamard codes to -linear Hadamard codes with , , and . First, we give a recursive construction of…
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
Topicsgraph theory and CDMA systems · Coding theory and cryptography
