Generalized hyperderivative Reed–Solomon codes
Abstract 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.
Authors
- Mahir Bilen Can (ORCID: https://orcid.org/0000-0002-0175-4897)
- Benjamin Horowitz
Institutions
- Tulane University (US)
Publication Details
- Journal
- Designs Codes and Cryptography
- Published
- 2026-04-01
- DOI
- https://doi.org/10.1007/s10623-026-01849-3
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Louisiana Board of Regents