Decoding sparse Reed-Solomon codes with known support
Motivated by the use of trace codes in low-bandwidth repair, we investigate the decoding of a Reed-Solomon subcode whose information polynomials are characterized by a known sparse support. We ask: Can we correct more errors by leveraging the known structure of the information polynomial? We affirma...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/178798 |