A Characterization of MDS Symbol-pair Codes over Two Types of Alphabets

TL;DR

This paper characterizes the symbol-pair distances of certain constacyclic codes over finite fields and chain rings, presenting new classes of MDS symbol-pair codes and proving their uniqueness within these classes.

Contribution

It provides a complete characterization of symbol-pair distances for specific constacyclic codes and introduces new MDS symbol-pair codes over finite chain rings, establishing their uniqueness.

Findings

Several classes of MDS symbol-pair constacyclic codes are constructed.

No other MDS symbol-pair codes exist within the studied class except those presented.

Some codes over chain rings cannot be derived from previous constructions.

Abstract

Symbol-pair codes are block codes with symbol-pair metrics designed to protect against pair-errors that may occur in high-density data storage systems. MDS symbol-pair codes are optimal in the sense that it can attain the highest pair-error correctability within the same code length and code size. Constructing MDS symbol-pair codes is one of the main topics in symbol-pair codes. In this paper, we characterize the symbol-pair distances of some constacyclic codes of arbitrary lengths over finite fields and a class of finite chain rings. Using the characterization of symbol-pair distance, we present several classes of MDS symbol-pair constacyclic codes and show that there is no other MDS symbol-pair code among the class of constacyclic codes except for what we present. Moreover, some of these MDS symbol-pair constacyclic codes over the finite chain rings cannot be obtained by previous work.