3 papers
cs.IT2021
Optimal Codes Correcting Localized Deletions
Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii +1
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 w…
cs.IT2021
Detecting Deletions and Insertions in Concatenated Strings with Optimal Redundancy
Serge Kas Hanna, Rawad Bitar
We study codes that can detect the exact number of deletions and insertions in concatenated binary strings. We construct optimal codes for the case of detecting up to $\del$ deleti…
cs.IT2018
List Decoding of Deletions Using Guess & Check Codes
Serge Kas Hanna, Salim El Rouayheb
Guess & Check (GC) codes are systematic binary codes that can correct multiple deletions, with high probability. GC codes have logarithmic redundancy in the length of the message $…