KAS Abdel-Ghaffar's research while affiliated with University of California, Davis and other places

Publications (2)

Conference Paper
Full-text available
Codes are presented that can correct the deletion or the insertion of a predetermined number of adjacent bits greater than or equal to three. This extends the constructions of codes beyond those proposed by Levenshtein fifty years ago to correct one or two adjacent deletions or insertions.
Conference Paper
Full-text available
A well-known method for balancing binary sequences, in the sense of forcing them to have as many zeroes as ones, was proposed by Knuth. It is based on the inversion of all bits beyond a certain balancing index, and communicating this index via a prefix. This principle has also been applied to balance runlength-limited (RLL) sequences. Another Knuth...

Citations

... In the same paper, Levenshtein proved that the redundancy of a b-burst-deletion correcting code is asymptoticaly lower bounded by log(n) + b − 1 and therefore, the code he provided is optimal up to a constant. In 2017, Schoeny et al presented a class of binary b-burst-deletion correcting codes which improves the redundancy from b (log(n/b + 1)) in [30] to log(n) + (b − 1) log log(n) + b − log(b). They also proved a non-asymptotic upper bound on the code size, which implies that their codes are optimal up to a term (b − 1) log log(n) + b − log(b). ...