Unique Decoding of Extended Subcodes of GRS Codes Using Error-Correcting Pairs
Yang Li, Zhenliang Lu, San Ling, Shixin Zhu, Kwok Yan Lam

TL;DR
This paper introduces a polynomial-time decoding algorithm for extended Han-Zhang codes using error-correcting pairs, characterizes deep holes, and constructs new MDS codes, advancing decoding theory for these codes.
Contribution
It provides the first explicit decoding method for extended Han-Zhang codes based on $ extit{ extbf{ extlangle} extell extlangle} $-error-correcting pairs, and characterizes their deep holes and covering radius.
Findings
Decoding algorithm corrects up to half the minimum distance.
Determined the covering radius of extended Han-Zhang codes.
Constructed new non-GRS MDS codes related to Roth-Lempel codes.
Abstract
Extended Han-Zhang codes are a class of linear codes where each code is either a non-generalized Reed-Solomon (non-GRS) maximum distance separable (MDS) code or a near MDS (NMDS) code. They have important applications in communication, cryptography, and storage systems. While many algebraic properties and explicit constructions of extended Han-Zhang codes have been well studied in the literature, their decoding has been unexplored. In this paper, we focus on their decoding problems in terms of -error-correcting pairs (-ECPs) and deep holes. On the one hand, we determine the existence and specific forms of their -ECPs, and further present an explicit decoding algorithm for extended Han-Zhang codes based on these -ECPs, which can correct up to errors in polynomial time, with about half of the minimum distance. On the other hand, we determine the…
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.
