Mixed Materials
Guess & Check Codes for Deletions and Synchronization
| Τίτλος: | Guess & Check Codes for Deletions 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 can correct all possible single deletions $(δ=1)$ with an asymptotically optimal redundancy. Finding similar codes for $δ\geq 2$ deletions is an open problem. We propose a new family of codes, that we call Guess & Check (GC) codes, that can correct, with high probability, a constant number of deletions $δ$ occurring at uniformly random positions within an arbitrary string. The GC codes are based on MDS codes and have an asymptotically optimal redundancy that is $Θ(δ\log n)$. We provide deterministic polynomial time encoding and decoding schemes for these codes. We also describe the applications of GC codes to file synchronization. |
| Συγγραφείς: | Hanna, Serge Kas, Rouayheb, Salim El |
| Στοιχεία εκδότη: | 2017-02-15 2017-04-27 |
| Τύπος εγγράφου: | Mixed materials |
| Περίληψη: | Accepted in ISIT 2017 |
| Όροι ευρετηρίου: | Information Theory, text |
| Σύνδεσμος: | |
| Διαθεσιμότητα: | Open access content. Open access content |
| Other Numbers: | COO oai:arXiv.org:1702.04466 1106256326 |
| Πηγή συνεισφοράς: | CORNELL UNIV From OAIster®, provided by the OCLC Cooperative. |
| Αριθμός Καταχώρησης: | edsoai.on1106256326 |
| Βάση Δεδομένων: | OAIster |
| Η περιγραφή δεν είναι διαθέσιμη |