Break-Resilient Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911166748426240 |
|---|---|
| author | Wang, Canran Sima, Jin Raviv, Netanel |
| author_facet | Wang, Canran Sima, Jin Raviv, Netanel |
| contents | We investigate the problem of encoding data into an $(n, t)$-break-resilient code ($(n, t)$-BRC), i.e., a collections of sequences of length~$n$ from which the original data can be reconstructed even if they are adversarially broken at up to~$t$ arbitrary positions. We establish lower bounds on the redundancy of any $(n, t)$-BRC and present code constructions that meet these bounds up to asymptotically negligible terms. Interestingly, this problem shares similarities with the recently studied torn paper channel, which has emerged in the context of DNA data storage. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_03897 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Break-Resilient Codes Wang, Canran Sima, Jin Raviv, Netanel Information Theory We investigate the problem of encoding data into an $(n, t)$-break-resilient code ($(n, t)$-BRC), i.e., a collections of sequences of length~$n$ from which the original data can be reconstructed even if they are adversarially broken at up to~$t$ arbitrary positions. We establish lower bounds on the redundancy of any $(n, t)$-BRC and present code constructions that meet these bounds up to asymptotically negligible terms. Interestingly, this problem shares similarities with the recently studied torn paper channel, which has emerged in the context of DNA data storage. |
| title | Break-Resilient Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2310.03897 |