Sum rank Reed Muller style codes unify and generalize known code families

Sum-rank analogues of Reed--Muller codes over Abelian Galois extensions

Information Theory

Summary

The paper looks at a broad family of error-correcting codes used to protect data stored or sent across noisy channels. The authors identify a mathematical structure that links several well-known codes together, like Reed-Solomon and Gabidulin codes, by using special kinds of polynomials. They show how to describe these codes' sizes and minimum error-correcting ability exactly, extending to settings with multiple variables and different code shapes. This generalization helps understand and design new codes that balance different error models.

What this means in practice

  • For data storage engineers: Design error-correcting schemes that work under mixed error types using flexible sum-rank metric codes for reliable distributed storage.
  • For network coding developers: Implement sum-rank Reed–Muller type codes to improve error resilience in network protocols that face combined packet and symbol errors.

Authors

Alessandro Neri, Giuseppe Zampella

Abstract

Let $\mathbb L/\mathbb K$ be a finite Abelian Galois extension with a fixed decomposition $\mathrm{Gal}(\mathbb L/\mathbb K)=\langleσ_1\rangle\times\cdots\times\langleσ_m\rangle$. We show that the quotient of the multivariate skew polynomial ring $\mathbb L[x_1,\ldots,x_m;σ_1,\ldots,σ_m]$ by suitable central polynomials $H_1(x_1),\ldots,H_m(x_m)$ is isomorphic to a product of $t$ copies of $\mathrm{End}_{\mathbb K}(\mathbb L)$, so that one skew polynomial represents all blocks of a sum-rank metric space. The sum-rank weight of an element equals the rank of an associated Dickson matrix and of a generalized Moore matrix. Using this, we define sum-rank Reed--Muller-type codes and show that their dimension and minimum distance are given by the formulas for affine Cartesian codes with side lengths $\mathrm{deg}\,H_1,\ldots,\mathrm{deg}\,H_m$; the same holds for codes supported on lower sets. The family contains as special cases linearized Reed--Solomon codes, Gabidulin codes, rank-metric Reed--Muller codes, and affine Cartesian codes. Over finite fields, every linearized Reed--Muller code of Berardini and Caruso is, after a monomial change of variables, a monomial code in our framework. This gives the dimension of all these codes, and their exact minimum distance in every degree whenever the support is a lower set.