Mixed Materials
Guess & Check Codes for Deletions, Insertions, and Synchronization
| Τίτλος: | Guess & Check Codes for Deletions, Insertions, and Synchronization |
|---|---|
| Additional Titles: | We consider the problem of constructing codes that can correct $δ$ deletions occurring in an arbitrary binary string of length $n$ bits. Varshamov-Tenengolts (VT) codes, dating back to 1965, are zero-error single deletion $(δ=1)$ correcting codes, and have an asymptotically optimal redundancy. Finding similar codes for $δ\geq 2$ deletions remains an open problem. In this work, we relax the standard zero-error (i.e., worst-case) decoding requirement by assuming that the positions of the $δ$ deletions (or insertions) are independent of the codeword. Our contribution is a new family of explicit codes, that we call Guess & Check (GC) codes, that can correct with high probability up to a constant number of $δ$ deletions (or insertions). GC codes are systematic; and have deterministic polynomial time encoding and decoding algorithms. We also describe the application of GC codes to file synchronization. |
| Συγγραφείς: | Hanna, Serge Kas, Rouayheb, Salim El |
| Στοιχεία εκδότη: | 2017-05-24 2018-05-24 |
| Τύπος εγγράφου: | Mixed materials |
| Περίληψη: | Accepted to the IEEE Transactions on Information Theory. arXiv admin note: text overlap with arXiv:1702.04466 |
| Όροι ευρετηρίου: | Information Theory, text |
| Σύνδεσμος: | |
| Διαθεσιμότητα: | Open access content. Open access content |
| Other Numbers: | COO oai:arXiv.org:1705.09569 1106265734 |
| Πηγή συνεισφοράς: | CORNELL UNIV From OAIster®, provided by the OCLC Cooperative. |
| Αριθμός Καταχώρησης: | edsoai.on1106265734 |
| Βάση Δεδομένων: | OAIster |
| Η περιγραφή δεν είναι διαθέσιμη |