English

$\mathbb{Z}_p\mathbb{Z}_{p^2}\dots\mathbb{Z}_{p^s}$-Additive Generalized Hadamard Codes

Information Theory 2022-09-02 v2 math.IT

Abstract

The ZpZp2Zps\mathbb{Z}_p\mathbb{Z}_{p^2}\dots\mathbb{Z}_{p^s}-additive codes are subgroups of Zpα1×Zp2α2××Zpsαs\mathbb{Z}_p^{\alpha_1} \times \mathbb{Z}_{p^2}^{\alpha_2} \times \cdots \times \mathbb{Z}_{p^s}^{\alpha_s}, and can be seen as linear codes over Zp\mathbb{Z}_p when αi=0\alpha_i=0 for all i{2,,s}i \in \{2,\dots, s\}, a Zps\mathbb{Z}_{p^s}-additive code when αi=0\alpha_i=0 for all i{1,,s1}i \in \{1,\dots, s-1\} , or a ZpZp2\mathbb{Z}_p\mathbb{Z}_{p^2}-additive code when s=2s=2, or Z2Z4\mathbb{Z}_2\mathbb{Z}_4-additive codes when p=2p=2 and s=2s=2. A ZpZp2Zps\mathbb{Z}_p\mathbb{Z}_{p^2}\dots\mathbb{Z}_{p^s}-linear generalized Hadamard (GH) code is a GH code over Zp\mathbb{Z}_p which is the Gray map image of a ZpZp2Zps\mathbb{Z}_p\mathbb{Z}_{p^2}\dots\mathbb{Z}_{p^s}-additive code. In this paper, we generalize some known results for ZpZp2Zps\mathbb{Z}_p\mathbb{Z}_{p^2}\dots\mathbb{Z}_{p^s}-linear GH codes with pp prime and s2s\geq 2. First, we give a recursive construction of ZpZp2Zps\mathbb{Z}_p\mathbb{Z}_{p^2}\dots \mathbb{Z}_{p^s}-additive GH codes of type (α1,,αs;t1,,ts)(\alpha_1,\dots,\alpha_s;t_1,\dots,t_s) with t11,t2,,ts10t_1\geq 1, t_2,\dots,t_{s-1}\geq 0, and ts1t_s\geq1. Then, we show for which types the corresponding ZpZp2Zps\mathbb{Z}_p\mathbb{Z}_{p^2}\dots\mathbb{Z}_{p^s}-linear GH codes are nonlinear over Zp\mathbb{Z}_p. We also compute the kernel and its dimension whenever they are nonlinear.

Cite

@article{arxiv.2207.14702,
  title  = {$\mathbb{Z}_p\mathbb{Z}_{p^2}\dots\mathbb{Z}_{p^s}$-Additive Generalized Hadamard Codes},
  author = {Dipak Kumar Bhunia and Cristina Fernández-Córdoba and Mercè Villanueva},
  journal= {arXiv preprint arXiv:2207.14702},
  year   = {2022}
}

Comments

arXiv admin note: text overlap with arXiv:2203.15657, arXiv:2203.15407

R2 v1 2026-06-25T01:20:04.350Z