Metraipolis › archive › dc_b74754eb65ce
The kernel-block rank profiles of the $\mathbb{Z}_2\mathbb{Z}_4$-linear and the $\mathbb{Z}_{2^s}$-linear Hadamard codes, and a complete classification of the… — arXiv:2610.00142
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.00142
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T17:47:57.199Z
- SHA-256 of the archived text
beff41aac72cb387d71f70df569f1e75116d15142e58afe0e8936f09a1b1d049- Stable URL of this page
https://metraipolis.com/documento/dc_b74754eb65ce
How to cite
The kernel-block rank profiles of the $\mathbb{Z}_2\mathbb{Z}_4$-linear and the $\mathbb{Z}_{2^s}$-linear Hadamard codes, and a complete classification of the… — arXiv:2610.00142 — arXiv (en), https://arxiv.org/abs/2610.00142 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b74754eb65ce (Metraipolis archive dc_b74754eb65ce, sha256 beff41aac72cb387d71f70df569f1e75116d15142e58afe0e8936f09a1b1d049)
BibTeX
@misc{dcb74754eb65ce,
title = {The kernel-block rank profiles of the $mathbbZ_2mathbbZ_4$-linear and the $mathbbZ_2^s$-linear Hadamard codes, and a complete classification of the… — arXiv:2610.00142},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.00142},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b74754eb65ce; sha256 beff41aac72cb387d71f70df569f1e75116d15142e58afe0e8936f09a1b1d049},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.00142. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The kernel of a binary code containing the zero word partitions the binary coordinates into blocks, two coordinates lying in the same block when every kernel word takes the same value in both, and the \emph{kernel-block rank profile} is the multiset of the dimensions of its linear span punctured on those blocks. For the family $H^{t_1,t_2,t_3}$ of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard codes, this invariant is known explicitly and gives a complete classification of the family. In this paper, we compute it for the $\mathbb{Z}_2\mathbb{Z}_4$-linear and $\mathbb{Z}_{2^s}$-linear Hadamard families with which those codes are compared, and we prove that it is constant for every nonlinear $\mathbb{Z}_2\mathbb{Z}_4$-linear Hadamard code and for every nonlinear $\mathbb{Z}_{2^s}$-linear Hadamard code $\bar H^{a_1,\dots,a_s}$ with $s\geq2$. The second statement is obtained without any rank formula, by exhibiting coordinate permutations that preserve the code and act transitively on its kernel blocks, which makes the argument uniform in $s$. We also prove a descent theorem: if $\bar H^{a_1,\dots,a_s}$ is nonlinear and $a_1\geq2$, then the code punctured on one kernel block is the $\mathbb{Z}_{2^{s-1}}$-linear Hadamard code $\bar H^{a_1,\dots,a_{s-1}}$. Consequently, the constant local rank equals $rank(\bar H^{a_1,\dots,a_{s-1}})$ and is at least $t-\kappa+2$, where $2^t$ is the length and $\kappa$ the kernel dimension. These results separate every nonlinear $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard code from every $\mathbb{Z}_4$-linear, $\mathbb{Z}_2\mathbb{Z}_4$-linear and $\mathbb{Z}_{2^s}$-linear Hadamard code of the same length, except for the single infinite family $H^{1,1,t-4}$ and $\bar H^{2,0,t-5}$ with $t\geq5$. The members of this infinite family agree in the rank, kernel dimension and the kernel-block rank profile, but a two-block refinement separates them.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.00142 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T16:13:30.405Z dalla pagina https://arxiv.org/catchup/math.IT/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).