
TL;DR
This paper develops new deletion error-correcting codes in the oblivious model, bridging the gap between adversarial and random errors, with constructions that improve redundancy bounds and have applications in DNA storage.
Contribution
It introduces explicit, randomized, and list-decodable oblivious deletion codes, achieving redundancy bounds close to the theoretical limits and linking oblivious and adversarial deletion code constructions.
Findings
Constructed $t$ oblivious deletion codes with redundancy $ ilde{2t ext{log} n}$.
Explicit list-decodable codes yield oblivious deletion codes with similar parameters.
Randomized constructions achieve redundancy $ ilde{(t+1) ext{log} n}$ for oblivious deletions.
Abstract
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 the adversarial and random error models, and are motivated by applications like DNA storage, where the noise is caused by hard-to-model physical phenomena, but not by an adversary. (1) (Explicit oblivious) We construct oblivious deletion codes, with redundancy , matching the existential bound for adversarial deletions. (2) (List decoding implies explicit oblivious) We show that explicit list-decodable codes yield explicit oblivious deletion codes with essentially the same parameters. By a work of Guruswami and H\r{a}stad (IEEE TIT, 2021), this gives 2 oblivious deletion codes with redundancy , beating the existential redundancy for 2 adversarial deletions. (3)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
