A characterization of MDS codes that have an error correcting pair

Abstract

International audienceError–correcting pairs were introduced in 1988 in the preprint [1] that appeared in [2], and were found independently in [3], as a general algebraic method of decoding linear codes. These pairs exist for several classes of codes. However little or no study has been made for characterizing those codes. This article is an attempt to fill the vacuum left by the literature concerning this subject. Since every linear code is contained in an MDS code of the same minimum distance over some finite field extension, see [4], we have focused our study on the class of MDS codes. Our main result states that an MDS code of minimum distance 2t+1 has a t-ECP if and only if it is a generalized Reed–Solomon (GRS) code. A second proof is given using recent results and on the Schur product of codes