Generalized Hyperderivative Reed-Solomon Codes
By: Mahir Bilen Can, Benjamin Horowitz
This article introduces Generalized Hyperderivative Reed-Solomon codes (GHRS codes), which generalize NRT Reed-Solomon codes. Its main results are as follows: 1) every GHRS code is MDS, 2) the dual of a GHRS code is also an GHRS code, 3) determine subfamilies of GHRS codes whose members are low-density parity-check codes (LDPCs), and 4) determine a family of GHRS codes whose members are quasi-cyclic. We point out that there are GHRS codes having all of these properties.
Similar Papers
Hermitian Self-dual Twisted Generalized Reed-Solomon Codes
Information Theory
Makes secret messages harder to break.
Two Families of Linear Codes Containing Non-GRS MDS Codes
Information Theory
Makes data storage more reliable and error-proof.
On $(\mathcal{L},\mathcal{P})$-Twisted Generalized Reed-Solomon Codes
Information Theory
Makes data storage more reliable and error-free.