Adversarial Torn-paper Codes
FOS: Computer and information sciences
0301 basic medicine
03 medical and health sciences
Computer Science - Information Theory
Information Theory (cs.IT)
DOI:
10.48550/arxiv.2201.11150
Publication Date:
2022-06-26
AUTHORS (4)
ABSTRACT
Author submitted, peer-reviewed version<br/>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.<br/>
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES ()
CITATIONS ()
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....