Name
Abstract | ||
|---|---|---|
We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that we study is when at most k deletions occur in a window of size k, where the positions of the deletions within this window are not necessarily consecutive. Localized deletions are thus a generalization of burst deletions that occur in consecutive positions. We present novel explicit codes that are efficiently encodable and decodable and can correct up to k localized deletions. Furthermore, these codes have log n + O(k log(2) (k log n)) redundancy, where n is the length of the information message, which is asymptotically optimal in n for k = o(log n/(log log n)(2)). |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/ISIT45174.2021.9518196 | 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rawad Bitar | 1 | 0 | 0.34 |
| Serge Kas Hanna | 2 | 0 | 0.34 |
| Nikita Polyanskii | 3 | 0 | 0.34 |
| Ilya Vorobyev | 4 | 0 | 0.34 |