Roni Con

On the Average List Size of VT Codes under Two Insertions or Two Deletions

Anisha Banerjee, Roni Con, Antonia Wachter-Zeh +1

Levenshtein's classical theorem shows that any code that can uniquely decode from $t$ deletions can also uniquely decode from $t$ insertions. This symmetry, however, does not g…

math.CO2026

Sunflowers of Reed--Solomon Codes

Roni Con, Anina Gruica, Maria Montanucci +1

We introduce and study Reed--Solomon sunflowers, namely families of Reed--Solomon codes whose pairwise intersections are all equal to the same fixed subspace. This notion lies at t…

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…

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…

Oblivious Deletion Codes

Roni Con, Ray Li

We construct deletion error-correcting codes in the oblivious model, where errors are adversarial but oblivious to the encoder's randomness. Oblivious errors bridge the gap between…

Decoding Insertions/Deletions via List Recovery

Anisha Banerjee, Roni Con, Antonia Wachter-Zeh +1

In this work, we consider the problem of efficient decoding of codes from insertions and deletions. Most of the known efficient codes are codes with synchronization strings which a…

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…

Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate- $1/2$ 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…

Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions

Roni Con

In this work, we study the performance of Reed-Solomon codes against an adversary that first permutes the symbols of the codeword and then performs insertions and deletions. This a…

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets

Roni Con, Zeyu Guo, Ray Li +1

In this paper, we prove that with high probability, random Reed-Solomon codes approach the half-Singleton bound - the optimal rate versus error tradeoff for linear insdel codes - w…

Robust Gray Codes Approaching the Optimal Rate

Roni Con, Dorsa Fathollahi, Ryan Gabrys +2

Robust Gray codes were introduced by (Lolck and Pagh, SODA 2024). Informally, a robust Gray code is a (binary) Gray code $G$ so that, given a noisy version of the encodin…

One Code Fits All: Strong stuck-at codes for versatile memory encoding

Roni Con, Ryan Gabrys, Eitan Yaakobi

In this work we consider a generalization of the well-studied problem of coding for ``stuck-at'' errors, which we refer to as ``strong stuck-at'' codes. In the traditional framewor…

An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes

Shubhransh Singhvi, Roni Con, Han Mao Kiah +1

The sequence reconstruction problem, introduced by Levenshtein in 2001, considers a scenario where the sender transmits a codeword from some codebook, and the receiver obtains $N$ …