2 citations · 2 across the 1 of their papers we have counts for
1 paper
Serge Kas Hanna, Salim El Rouayheb
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 bac…