Publications (20)
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…
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 so that, given a noisy version of the encodin…
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 …
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
Roni Con, Noah Shutty, Itzhak Tamo +1
This paper presents two repair schemes for low-rate Reed-Solomon (RS) codes over prime fields that can repair any node by downloading a constant number of bits from each surviving…
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…
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…