Construction of new error correcting codes from special field extensions

On MRD constacyclic codes over inseparable field extensions

Information Theory

Summary

Some error-correcting codes, which help fix mistakes in data, come from known rules about certain mathematical fields. This paper finds a new way to build a particular type called MRD constacyclic codes using unusual fields where usual rules don’t apply. These new codes are different and can’t be created by earlier methods. The authors show how to do this for code lengths related to the prime number that defines the field's behavior.

What this means in practice

  • For data storage engineers: Build error-correcting schemes based on new MRD constacyclic codes for storage systems using inseparable field structures.
  • For network coding developers: Design network coding protocols employing novel MRD codes to improve error correction in channels modeled by inseparable fields.

A theory result. No direct application yet.

Authors

Grégory Berhuy

Abstract

In this paper, we construct MRD constacyclic codes of length $p$ over an inseparable field extension $L/K$, where $K$ has characteristic $p$. In particular, these codes cannot be obtained from known constructions.