The error-correcting pair for several classes of NMDS linear codes
Dong He, Zhaohui Zhang, Qunying Liao

TL;DR
This paper investigates the conditions under which NMDS linear codes possess error-correcting pairs, providing necessary conditions, examples, and leveraging twisted generalized Reed-Solomon codes to illustrate specific cases.
Contribution
It offers new necessary conditions for the existence of error-correcting pairs in NMDS codes and provides explicit examples using twisted generalized Reed-Solomon codes.
Findings
Necessary conditions for NMDS codes with minimal distance 2ℓ+1
Necessary conditions for NMDS codes with minimal distance 2ℓ+2
Explicit examples illustrating specific parameter cases
Abstract
The error-correcting pair is a general algebraic decoding method for linear codes. The near maximal distance separable (NMDS) linear code is a subclass of linear codes and has applications in secret sharing scheme and communication systems due to the efficient performance, thus we focus on the error-correcting pair of NMDS linear codes. In 2023, He and Liao showed that for an NMDS linear code with minimal distance or , if has an -error-correcting pair , then the parameters of have 6 or 10 possibilities, respectively. In this manuscript, basing on Product Singleton Bound, we give several necessary conditions for that the NMDS linear code with minimal distance has an -error-correcting pair , where the parameters of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Error Correcting Code Techniques
