On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability

DOI10.1016/j.ffa.2021.101841zbMath1468.94475OpenAlexW3145823438MaRDI QIDQ2031639

Ivan Tjuawinata, Shu Liu

Publication date: 10 June 2021

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2021.101841

zbMATH Keywords

Reed-Solomon codescoding theoryinsertion and deletion errors

Mathematics Subject Classification ID

Synchronization error-correcting codes (94B50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decoding of Reed Solomon codes beyond the error-correction bound
• Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes
• Traitor Tracing for Shortened and Corrupted Fingerprints
• Optimal Rate List Decoding via Derivative Codes
• Nonbinary codes, correcting single deletion or insertion (Corresp.)
• Algebraic soft-decision decoding of reed-solomon codes
• Classification of the Deletion Correcting Capabilities of Reed–Solomon Codes of Dimension $2$ Over Prime Fields
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Efficient decoding of Reed-Solomon codes beyond half the minimum distance
• Error Detecting and Error Correcting Codes
• Synchronization strings
• Synchronization strings: explicit constructions, local decoding, and applications
• Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms

This page was built for publication: On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability