Adversarial Torn-Paper Codes
Daniella Bar-Lev, Sagi Marcovich, Eitan Yaakobi, Yonatan Yehezkeally
Abstract
We study the adversarial torn-paper channel. This problem is motivated by applications in DNA data storage where the DNA strands that carry information may break into smaller pieces which are received out of order. Our model extends the previously researched probabilistic setting to the worst-case. We develop code constructions for any parameters of the channel for which non-vanishing asymptotic rate is possible and show our constructions achieve asymptotically optimal rate while allowing for efficient encoding and decoding. Finally, we extend our results to related settings included multi-strand storage, presence of substitution errors, or incomplete coverage.
Topics & Concepts
Decoding methodsProbabilistic logicEncoding (memory)Computer scienceChannel (broadcasting)Code (set theory)AlgorithmTheoretical computer scienceAdversarial systemArtificial intelligenceComputer networkProgramming languageSet (abstract data type)DNA and Biological ComputingCellular Automata and ApplicationsAlgorithms and Data Compression