On the error-correcting pair for MDS linear codes with even minimum distance

The error-correcting pair is a general algebraic decoding method for linear codes, which exists for many classical linear codes. Since every linear code is contained in an MDS linear code with the same minimum distance over some finite field extension, we focus our study on MDS linear codes. It is well-known that an MDS linear code with minimum distance 2$ +1 has an $-error-correcting pair if and only if it is a generalized Reed-Solomon code. In this paper, we show that for an MDS linear code C with minimal distance 2$ + 2, if it has an $-error-correcting pair, then the parameters of the pair are three cases. For one case, we give a necessary condition that C is a generalized Reed-Solomon code, and then give some counterexamples that C is a non-generalized Reed-Solomon code for the other two cases.(c) 2023 Elsevier Inc. All rights reserved.

Automated summary

This paper investigates the error-correcting pair method for linear codes, focusing on MDS linear codes with minimum distance 2$+2$. It is found that MDS linear codes with an error-correcting pair have three possible parameter cases, where one case requires the code to be a generalized Reed-Solomon code.