On the error-correcting pair for MDS linear codes with even minimum distance
From MaRDI portal
Publication:6156924
DOI10.1016/j.ffa.2023.102210zbMath1518.94130MaRDI QIDQ6156924
Publication date: 19 June 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
generalized Reed-Solomon codetwisted generalized Reed-Solomon codeerror-correcting pairMDS linear code
Related Items (2)
The error-correcting pair for TGRS codes ⋮ The properties and the error-correcting pair for lengthened GRS codes
Cites Work
- Unnamed Item
- Unnamed Item
- Deep holes in Reed-Solomon codes based on Dickson polynomials
- A characterization of MDS codes that have an error correcting pair
- On decoding by error location and dependent sets of error positions
- Decoding of Reed Solomon codes beyond the error-correction bound
- On the existence of error-correcting pairs
- Construction of MDS twisted Reed-Solomon codes and LCD MDS codes
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
- On Reed-Solomon codes
- On a decoding algorithm for codes on maximal curves
- A construction of non-Reed-Solomon type MDS codes
- Error-locating pairs for cyclic codes
- Fundamentals of Error-Correcting Codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- The Weights in MDS Codes
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
This page was built for publication: On the error-correcting pair for MDS linear codes with even minimum distance