$\mathbb{Z}_p\mathbb{Z}_{p^2}\dots\mathbb{Z}_{p^s}$-Additive Generalized Hadamard Codes
Dipak Kumar Bhunia, Cristina Fern\'andez-C\'ordoba, Merc\`e Villanueva

TL;DR
This paper introduces a recursive method to construct generalized Hadamard codes from additive codes over mixed rings, analyzes their linearity properties, and computes kernel dimensions for nonlinear cases.
Contribution
It generalizes existing results on $bZ_pbZ_{p^2} imesbZ_{p^s}$-linear GH codes to broader types and provides a recursive construction method.
Findings
Recursive construction of additive GH codes with specified parameters.
Identification of types where GH codes are nonlinear over $bZ_p$.
Calculation of kernel and its dimension for nonlinear GH codes.
Abstract
The -additive codes are subgroups of , and can be seen as linear codes over when for all , a -additive code when for all , or a -additive code when , or -additive codes when and . A -linear generalized Hadamard (GH) code is a GH code over which is the Gray map image of a -additive code. In this paper, we generalize some known results for -linear GH codes with prime and . First,…
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
