9 papers
Capacity of Additive-Noise Sticky Channels
Cécile Bouette, Samuel Pearson, Roni Con +1
Sticky channels, which never destroy nor create runs, are some of the simplest types of channels with synchronization errors (such as deletions, insertions, and replications). Desp…
The Insertion List-Decoding Capacity and an Improved Bound on the Deletion List-Decoding Capacity
Roni Con, Dean Doron, João Ribeiro
Informally, the capacity of list-decoding in a given adversarial error model is the largest rate at which we can list-decode with list size polynomial in the block length. The capa…
Channels with Input-Correlated Synchronization Errors
Roni Con, João Ribeiro
"Independent and identically distributed" errors do not accurately capture the noisy behavior of real-world data storage and information transmission technologies. Motivated by thi…
Expected Recovery Time in DNA-based Distributed Storage Systems
Adi Levy, Roni Con, Eitan Yaakobi +1
We initiate the study of DNA-based distributed storage systems, where information is encoded across multiple DNA data storage containers to achieve robustness against container fai…
Improved Constructions of Linear Codes for Insertions and Deletions
Roee Gross, Roni Con, Eitan Yaakobi
In this work, we study linear error-correcting codes against adversarial insertion-deletion (indel) errors. While most constructions for the indel model are nonlinear, linear codes…
Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate- Codes
Peter Beelen, Roni Con, Anina Gruica +2
The performance of Reed--Solomon codes (RS codes, for short) in the presence of insertion and deletion errors has attracted growing attention in recent literature. In this work, we…