📖
The rank of $\mathbb{Z}_{2^s}$-linear Hadamard codes
Xuan Wang, Minjia Shi

The rank of $\mathbb{Z}_{2^s}$-linear Hadamard codes

Author / Organization:
Computer Science & Mathematics Published 2026 Verification Pending

Overview & Synopsis

The canonical $\mathbb{Z}_{2^s}$-linear Hadamard codes are the Gray images of the $\mathbb{Z}_{2^s}$-additive codes. Their rank, the dimension of the binary linear span, was known in closed form only for $s\le 3$, and for $s \ge 4$ only through computer computations for small lengths. We give a method that computes the rank for every $s$. We show that the rank is a binomial polynomial in the type parameters, with coefficients $ρ_s(\boldsymbol{k})$ independent of the length. We compute all the coefficients for $s\le 5$, which yields explicit rank formulas over $\mathbb{Z}_4$ and $\mathbb{Z}_8$ (recovering the known ones), and over $\mathbb{Z}_{16}$ and $\mathbb{Z}_{32}$.

Advertisement
SPONSOR CONTENT
Indexed from repository: arXiv (arxiv.org)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title The rank of $\mathbb{Z}_{2^s}$-linear Hadamard codes
Author / Organization Xuan Wang, Minjia Shi
Subject & Discipline cs.IT
Categories Computer Science & Mathematics
Publication Year 2026
License / Rights arXiv Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website arXiv (arxiv.org)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-6055
Original Source Link Visit Source Page on arxiv.org »