Cover Image

Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Con, Roni, Shpilka, Amir, Tamo, Itzhak
Format:	Preprint
Published:	2023
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions
by: Con, Roni
Published: (2024)

Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
by: Con, Roni, et al.
Published: (2024)

Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes
by: Beelen, Peter, et al.
Published: (2025)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)

An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes
by: Singhvi, Shubhransh, et al.
Published: (2024)

Improved Constructions of Linear Codes for Insertions and Deletions
by: Gross, Roee, et al.
Published: (2025)

Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
by: Berman, Amit, et al.
Published: (2024)

Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors
by: Singhvi, Shubhransh
Published: (2024)

Oblivious Deletion Codes
by: Con, Roni, et al.
Published: (2025)

Decoding Algorithm to Composite Errors Consisting of Deletions and Insertions for Quantum Deletion-Correcting Codes Based on Quantum Reed-Solomon Codes
by: Sasaki, Koki, et al.
Published: (2026)

Decoding Insertions/Deletions via List Recovery
by: Banerjee, Anisha, et al.
Published: (2025)

Two-Insertion/Deletion/Substitution Correcting Codes
by: Pi, Yuhang, et al.
Published: (2024)

Algebraic Expander Codes
by: Kopparty, Swastik, et al.
Published: (2026)

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
by: Berman, Amit, et al.
Published: (2026)

Insertion Correcting Capability for Quantum Deletion-Correcting Codes
by: Nakamura, Ken, et al.
Published: (2026)

Function-Correcting Codes for Insertion-Deletion Channel
by: Singh, Anamika, et al.
Published: (2025)

Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)

$\varepsilon$-MSR Codes for Any Set of Helper Nodes
by: Ramkumar, Vinayak, et al.
Published: (2024)

Non-Binary Covering Codes for Low-Access Computations
by: Ramkumar, Vinayak, et al.
Published: (2024)

Quantum Locally Recoverable Codes via Good Polynomials
by: Sharma, Sandeep, et al.
Published: (2024)

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
by: Berman, Amit, et al.
Published: (2023)

Coding Theorem for Generalized Reed-Solomon Codes
by: Zheng, Xiangping, et al.
Published: (2025)

List Decoding of Reed-Solomon Codes and Folded Reed-Solomon Codes Over Galois Ring
by: Yuan, Chen, et al.
Published: (2025)

Column Twisted Reed-Solomon Codes as MDS Codes
by: Liu, Wei, et al.
Published: (2025)

Deep Holes of Twisted Reed-Solomon Codes
by: Fang, Weijun, et al.
Published: (2024)

Unique Decoding of Hyperderivative Reed-Solomon Codes
by: Gu, Haojie, et al.
Published: (2026)

Error-Correcting Codes for Two Bursts of t1-Deletion-t2-Insertion with Low Computational Complexity
by: Liu, Yajuan, et al.
Published: (2026)

Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach
by: Qiu, Jing, et al.
Published: (2026)

Generalized Hyperderivative Reed-Solomon Codes
by: Can, Mahir Bilen, et al.
Published: (2025)

One Code Fits All: Strong stuck-at codes for versatile memory encoding
by: Con, Roni, et al.
Published: (2024)

Hermitian Self-dual Generalized Reed-Solomon Codes
by: Zhao, Chun'e, et al.
Published: (2026)

Channels with Input-Correlated Synchronization Errors
by: Con, Roni, et al.
Published: (2025)

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
by: Doron, Dean, et al.
Published: (2024)

Distinguishers for Skew and Linearized Reed-Solomon Codes
by: Hörmann, Felicitas, et al.
Published: (2026)

Robust Gray Codes Approaching the Optimal Rate
by: Con, Roni, et al.
Published: (2024)

Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
by: Jeronimo, Fernando Granha, et al.
Published: (2026)

Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent
by: Levi, Matan, et al.
Published: (2024)

Explicit List-Decodable Linearized Reed-Solomon and Folded Linearized Reed-Solomon Subcodes
by: Shang, Kuo, et al.
Published: (2026)

Hermitian Self-dual Twisted Generalized Reed-Solomon Codes
by: Zhao, Chun'e, et al.
Published: (2025)

Private Repair of a Single Erasure in Reed-Solomon Codes
by: Kruglik, Stanislav, et al.
Published: (2024)