Showing cs.ITShow all
3 papers · 1 filter
cs.IT2025
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…
cs.IT2025
Near-Optimal List-Recovery of Linear Code Families
Ray Li, Nikhil Shagrithaya
We prove several results on linear codes achieving list-recovery capacity. We show that random linear codes achieve list-recovery capacity with constant output list size (independe…
cs.IT2024
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…