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 |
| _version_ | 1811691321785581568 |
|---|---|
| author | Kim, Wilton Raj, Joel Nathanael Kruglik, Stanislav Kiah, Han Mao |
| author2 | Interdisciplinary Graduate School (IGS) |
| author_facet | Interdisciplinary Graduate School (IGS) Kim, Wilton Raj, Joel Nathanael Kruglik, Stanislav Kiah, Han Mao |
| author_sort | Kim, Wilton |
| collection | NTU |
| description | 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 affirmatively respond to this query by introducing two schemes designed to complement any Reed-Solomon decoder. Our findings demonstrate better error-correcting capabilities than the naive way to decode based on the maximum degree of the information polynomial. |
| first_indexed | 2024-10-01T06:18:02Z |
| format | Conference Paper |
| id | ntu-10356/178798 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T06:18:02Z |
| publishDate | 2024 |
| record_format | dspace |
| spelling | ntu-10356/1787982024-08-25T15:36:11Z Decoding sparse Reed-Solomon codes with known support Kim, Wilton Raj, Joel Nathanael Kruglik, Stanislav Kiah, Han Mao Interdisciplinary Graduate School (IGS) School of Physical and Mathematical Sciences 2024 IEEE International Symposium on Information Theory (ISIT) Strategic Centre for Research in Privacy-Preserving Technologies & Systems (SCRIPTS) Computer and Information Science Mathematical Sciences Reed-Solomon codes Sparse polynomial Decoder 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 affirmatively respond to this query by introducing two schemes designed to complement any Reed-Solomon decoder. Our findings demonstrate better error-correcting capabilities than the naive way to decode based on the maximum degree of the information polynomial. Ministry of Education (MOE) Submitted/Accepted version The work of Wilton Kim was supported by SCRiPTS, Interdisciplinary Graduate Programme, Nanyang Technological University, Singapore. The work of Stanislav Kruglik was supported by the Ministry of Education, Singapore, under its MOE AcRF Tier 2 Award under Grant MOE-T2EP20121-0007. The work of Han Mao Kiah was supported by the Ministry of Education, Singapore, under its MOE AcRF Tier 2 Award under Grant MOE-T2EP20121-0007 and MOE AcRF Tier 1 Award under Grant RG19/23 2024-08-22T06:03:44Z 2024-08-22T06:03:44Z 2024 Conference Paper Kim, W., Raj, J. N., Kruglik, S. & Kiah, H. M. (2024). Decoding sparse Reed-Solomon codes with known support. 2024 IEEE International Symposium on Information Theory (ISIT). https://dx.doi.org/10.1109/ISIT57864.2024.10619533 https://hdl.handle.net/10356/178798 10.1109/ISIT57864.2024.10619533 en MOE-T2EP20121-0007 RG19/23 © 2024 IEEE. All rights reserved. This article may be downloaded for personal use only. Any other use requires prior permission of the copyright holder. The Version of Record is available online at http://doi.org/10.1109/ISIT57864.2024.10619533. application/pdf |
| spellingShingle | Computer and Information Science Mathematical Sciences Reed-Solomon codes Sparse polynomial Decoder Kim, Wilton Raj, Joel Nathanael Kruglik, Stanislav Kiah, Han Mao Decoding sparse Reed-Solomon codes with known support |
| title | Decoding sparse Reed-Solomon codes with known support |
| title_full | Decoding sparse Reed-Solomon codes with known support |
| title_fullStr | Decoding sparse Reed-Solomon codes with known support |
| title_full_unstemmed | Decoding sparse Reed-Solomon codes with known support |
| title_short | Decoding sparse Reed-Solomon codes with known support |
| title_sort | decoding sparse reed solomon codes with known support |
| topic | Computer and Information Science Mathematical Sciences Reed-Solomon codes Sparse polynomial Decoder |
| url | https://hdl.handle.net/10356/178798 |
| work_keys_str_mv | AT kimwilton decodingsparsereedsolomoncodeswithknownsupport AT rajjoelnathanael decodingsparsereedsolomoncodeswithknownsupport AT kruglikstanislav decodingsparsereedsolomoncodeswithknownsupport AT kiahhanmao decodingsparsereedsolomoncodeswithknownsupport |