Two Families of Linear Codes Containing Non-GRS MDS Codes
By: Kanat Abdukhalikov, Gyanendra K. Verma
We construct two new families of linear codes by modifying the generator matrices of generalized Reed-Solomon (GRS) codes. For these codes, we explicitly derive parity-check matrices and establish necessary and sufficient conditions ensuring the MDS property. Additionally, we explore subfamilies within these constructions that are non-GRS MDS codes. We also characterize their self-orthogonal and self-dual properties and present some explicit constructions and examples.
Similar Papers
New Constructions of Non-GRS MDS Codes, Recovery and Determination Algorithms for GRS Codes
Information Theory
Makes data storage more reliable and efficient.
Some constructions of non-generalized Reed-Solomon MDS Codes
Information Theory
Finds new ways to store and protect computer information.
Properties and Decoding of Twisted GRS Codes and Their Extensions
Information Theory
Fixes data errors in computer storage.