An indel refers to a single insertion or deletion, while an edit refers to a single insertion,
deletion or substitution. In this article, we investigate codes that correct either a single indel …

We consider construction of deletion and substitution correcting codes with low redundancy
and efficient encoding/decoding. First, by simplifying the method of Sima et al.(ISIT 2020) …

As a powerful tool for storing digital information in chemically synthesized molecules, DNA-
based data storage has undergone continuous development and received increasingly …

Mutually uncorrelated (MU) codes are a class of codes in which no proper prefix of one
codeword is a suffix of another codeword. These codes were originally studied for …

Permutation codes and multi-permutation codes have been widely considered due to their
various applications, especially in flash memory. In this paper, we consider permutation …

The problem of correcting deletions and insertions has recently received significantly
increased attention due to the DNA-based data storage technology, which suffers from …

Motivated by the sequence reconstruction problem from traces in DNA-based storage, we
consider the problem of designing codes for the deletion channel when multiple …

A proof that the Helberg code is capable of correcting multiple deletion/insertion errors is
presented. This code is a generalization of the number-theoretic Levenshtein code which is …

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 …

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 back to …