Repair of Reed-Solomon codes in the presence of erroneous nodes

We consider the repair scheme of Guruswami-Wootters for the Reed-Solomon code and ask: can we correctly repair a failed node in the presence of erroneous nodes? Equivalently, we consider the collection of downloaded traces as a code and investigate its code-distance properties. We propose three l...

Full description

Saved in:
Bibliographic Details
Main Authors: Kruglik, Stanislav, Luo, Gaojun, Kim, Wilton, Singhvi, Shubhransh, Kiah, Han Mao, Ling, San, Wang, Huaxiong
Other Authors: School of Physical and Mathematical Sciences
Format: Conference or Workshop Item
Language:English
Published: 2023
Subjects:
Online Access:https://hdl.handle.net/10356/168955
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-168955
record_format dspace
spelling sg-ntu-dr.10356-1689552023-09-04T15:34:03Z Repair of Reed-Solomon codes in the presence of erroneous nodes Kruglik, Stanislav Luo, Gaojun Kim, Wilton Singhvi, Shubhransh Kiah, Han Mao Ling, San Wang, Huaxiong School of Physical and Mathematical Sciences 2023 IEEE International Symposium on Information Theory (ISIT) Engineering::Computer science and engineering Science::Mathematics Reed-Solomon Codes Codes We consider the repair scheme of Guruswami-Wootters for the Reed-Solomon code and ask: can we correctly repair a failed node in the presence of erroneous nodes? Equivalently, we consider the collection of downloaded traces as a code and investigate its code-distance properties. We propose three lower bounds on its minimum distance and study methods to efficiently correct errors close to these bounds. Ministry of Education (MOE) Nanyang Technological University National Research Foundation (NRF) Submitted/Accepted version This research/project is supported by the National Research Foundation, Singapore under its Strategic Capability Research Centres Funding Initiative, Singapore Ministry of Education Academic Research Fund Tier 2 Grants MOE2019-T2-2-083 and MOE-T2EP20121-0007, and Nanyang Technological University Research Grant No. 04INS000047C230GRT01. 2023-08-29T00:40:34Z 2023-08-29T00:40:34Z 2023 Conference Paper Kruglik, S., Luo, G., Kim, W., Singhvi, S., Kiah, H. M., Ling, S. & Wang, H. (2023). Repair of Reed-Solomon codes in the presence of erroneous nodes. 2023 IEEE International Symposium on Information Theory (ISIT). https://dx.doi.org/10.1109/ISIT54713.2023.10206718 978-1-6654-7554-9 2157-8117 https://hdl.handle.net/10356/168955 10.1109/ISIT54713.2023.10206718 en MOE2019-T2-2-083 MOE-T2EP20121-0007 04INS000047C230GRT01 © 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/ISIT54713.2023.10206718. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Engineering::Computer science and engineering
Science::Mathematics
Reed-Solomon Codes
Codes
spellingShingle Engineering::Computer science and engineering
Science::Mathematics
Reed-Solomon Codes
Codes
Kruglik, Stanislav
Luo, Gaojun
Kim, Wilton
Singhvi, Shubhransh
Kiah, Han Mao
Ling, San
Wang, Huaxiong
Repair of Reed-Solomon codes in the presence of erroneous nodes
description We consider the repair scheme of Guruswami-Wootters for the Reed-Solomon code and ask: can we correctly repair a failed node in the presence of erroneous nodes? Equivalently, we consider the collection of downloaded traces as a code and investigate its code-distance properties. We propose three lower bounds on its minimum distance and study methods to efficiently correct errors close to these bounds.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Kruglik, Stanislav
Luo, Gaojun
Kim, Wilton
Singhvi, Shubhransh
Kiah, Han Mao
Ling, San
Wang, Huaxiong
format Conference or Workshop Item
author Kruglik, Stanislav
Luo, Gaojun
Kim, Wilton
Singhvi, Shubhransh
Kiah, Han Mao
Ling, San
Wang, Huaxiong
author_sort Kruglik, Stanislav
title Repair of Reed-Solomon codes in the presence of erroneous nodes
title_short Repair of Reed-Solomon codes in the presence of erroneous nodes
title_full Repair of Reed-Solomon codes in the presence of erroneous nodes
title_fullStr Repair of Reed-Solomon codes in the presence of erroneous nodes
title_full_unstemmed Repair of Reed-Solomon codes in the presence of erroneous nodes
title_sort repair of reed-solomon codes in the presence of erroneous nodes
publishDate 2023
url https://hdl.handle.net/10356/168955
_version_ 1779156751873998848