MDS codes built on hyperelliptic curves for better error correction

MDS Algebraic Geometry Codes of Square-Root Length on Hyperelliptic Curves

Information Theory

Summary

The authors developed a special kind of error-correcting code called MDS (maximum distance separable) codes using mathematical objects called hyperelliptic curves. These codes have lengths approximately the square root of the size of the alphabet used, which is unusual compared to existing codes. Their codes achieve optimal error correction parameters and are distinct from traditional Reed–Solomon codes when the alphabet size gets large enough. This work provides new ways to design codes that could improve data transmission and storage reliability.

What this means in practice

  • For data storage engineers: Design error-correcting codes with near-optimal parameters for storage systems operating over large alphabets with code lengths around the square root of the alphabet size.
  • For communications protocol developers: Develop robust data transmission schemes using newly constructed algebraic geometry codes that differ from classical Reed–Solomon codes for improving error resilience.

Authors

Chuangqiang Hu, Guorui Ma

Abstract

For every fixed genus $g\geq2$ and every $0<ρ<1$, we construct maximum distance separable (MDS) algebraic geometry codes over $\F_q$ for all sufficiently large odd squares $q$. Their parameters are $\bigl[n,\lfloorρn\rfloor,n-\lfloorρn\rfloor+1\bigr]_q$ with $n=\sqrt q+1+O_g(q^{1/4})$. The codes use full Riemann--Roch spaces on genus-$g$ hyperelliptic curves. They are not monomially equivalent to generalized Reed--Solomon (GRS) codes when $q$ is sufficiently large. An infinite subfamily has exact length $n=\sqrt q+2gq^{1/4}+1$.