General
The rank of $\mathbb{Z}_{2^s}$-linear Hadamard codes
arXiv math.IT0 views
arXiv:2610.34730v1 Announce Type: new Abstract: 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 $\rho_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}$.
Source:https://arxiv.org/abs/2610.34730PreviousSemantic SCL Decoding for Polar CodesNextOn the Existence of Complete Coverings of Lee Spheres
Related posts

How we halved DNS build delay and cut memory use by 85%
0Cloudflare Blog
Birdbuddy vs. Birdfy: Which Budget Smart Feeder Should You Buy? (2026)
0Wired
2 days till TechCrunch Founder Summit: Boston founders don’t need a Silicon Valley address to build something big
0TechCrunch
Adventurer returns home to Hull after 28-year walk from South America
0Hacker News New
Vending machine has terms and conditions you must accept before using [video]
0Hacker News New
Tomorrow Corporation Tech Demo [video]
0Hacker News New