4 citations · 4 across the 17 of their papers we have counts for
5 papers · 1 filter
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…
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…