An Improvement for Error-Correcting Pairs of Some Special MDS Codes

• Published in: International journal of foundations of computer science 2024-07, p.1-15
• Main Authors: Xiao, Rui, Liao, Qunying
• Format: Article
• Language: English
• ISSN: 0129-0541; 1793-6373
• DOI: 10.1142/S0129054124500102

The error-correcting pair is a general algebraic decoding method for linear codes. Since every linear code is contained in an MDS linear code with the same minimum distance over some finite field extensions, we focus on MDS linear codes. Recently, He and Liao showed that for an MDS linear code [Formula: see text] with minimum distance [Formula: see text], if it has an [Formula: see text]-error-correcting pair, then the parameters of the pair have three possibilities. Moreover, for the first case, they gave a necessary condition for an MDS linear code [Formula: see text] with minimum distance [Formula: see text] to have an [Formula: see text]-error-correcting pair, and for the other two cases, they only gave some counterexamples. For the second case, in this paper, we give a necessary condition for an MDS linear code [Formula: see text] with minimum distance [Formula: see text] to have an [Formula: see text]-error-correcting pair, and then basing on the Product Singleton Bound, we prove that there are two cases for such pairs, and then give some counterexamples basing on twisted generalized Reed–Solomon codes for these cases.