Random reed-solomon codes achieve the half-singleton bound for insertions and deletions over linear-sized alphabets
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-with …
the half-Singleton bound-the optimal rate versus error tradeoff for linear insdel codes-with …
Error correction for dna storage
DNA-based storage is an emerging technology that provides high information density and
longevity. Noise and errors are present in almost every stage of the process: writing, storing …
longevity. Noise and errors are present in almost every stage of the process: writing, storing …
Linear insertion deletion codes in the high-noise and high-rate regimes
This work continues the study of linear error correcting codes against adversarial insertion
deletion errors (insdel errors). Previously, the work of Cheng, Guruswami, Haeupler, and …
deletion errors (insdel errors). Previously, the work of Cheng, Guruswami, Haeupler, and …
Computationally relaxed locally decodable codes, revisited
We revisit computationally relaxed locally decodable codes (crLDCs)(Blocki et al., Trans. Inf.
Theory'21) and give two new constructions. Our first construction is a Hamming crLDC that is …
Theory'21) and give two new constructions. Our first construction is a Hamming crLDC that is …