OpenAlex ·
Full classification of $\mathbb{Z}_{p^s}$-linear generalized Hadamard codes
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.18409
- Original
- Read it at the publisher
- Topics
Abstract
The $\mathbb{Z}_{p^s}$-additive codes are subgroups of $\mathbb{Z}_{p^s}^n$. A $\mathbb{Z}_{p^s}$-linear generalized Hadamard (GH) code is a GH code over $\mathbb{Z}_p$ which is the Gray map image of a $\mathbb{Z}_{p^s}$-additive code. A recursive construction gives such codes $H_p^{t_1,\dots,t_s}$, of type $(n;t_1,\dots,t_s)$ and length $p^t$, and a partial classification of them is known. In this paper, we complete the classification of these codes for every prime $p$. The main tool is the derived code, obtained by puncturing the code outside a block of coordinates determined by its kernel. For a nonlinear code $H_p^{t_1,\dots,t_s}$ with $t_1\geq2$, the derived code is a $\mathbb{Z}_{p^{s-1}}$-linear GH code of the same family, although the mechanism for odd $p$ differs from the binary one. As a consequence, for $t\geq3$, there are $\mathcal P(t+1)-\mathcal P(t)$ nonequivalent such codes of length $p^t$ if $p$ is odd, and $\mathcal P(t+1)-\mathcal P(t)-1$ if $p=2$, where $\mathcal P(n)$ is the number of partitions of $n$. In particular, this completes the classification of the $\mathbb{Z}_{2^s}$-linear Hadamard codes. We also prove a conjecture on the codes with $t_1\geq2$ and $t_s=0$.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
A Minimum Exact Disjunctive Basis for Two-Robot Solvability Profiles
Quantized six-vertex realizations of frustration graphs
A Randomized Approximation Algorithm for Doubly Free-Boundary Macdonald Processes
Degeneracy graph determinants and higher-dimensional Young diagrams
Selecting the 7th Smallest of 16 Elements Takes Exactly 28 Comparisons
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.