Correcting Tail Deletions in Rank Modulated Composite Encoding for Data Storage in DNA
For DNA data storage researchers, this work addresses error correction in a specific coding scheme, but the results are incremental.
The paper studies deletion and insertion codes for rank modulated composite encoding in DNA storage, presenting bounds and constructions of efficient codes over partial permutations.
We study the combination of two recent coding approaches, in the context of DNA based data storage. Composite DNA alphabets leverage properties of the DNA synthesis and sequencing process. A composite symbol does not represent a single nucleotide, but rather a designed mixture of DNA nucleotides. Using the high multiplicity that is intrinsic to synthesis and sequencing a composite symbol consists of frequencies in the mixture. Rank modulation codes use permutations to represent information. Combining the two, we construct encoding that uses permutations of nucleotide frequencies rather than the exact frequency values. Codes for this approach were addressed in previous work, under Kendall's tau distances. In this work we study deletion and insertion codes. We present bounds and constructions of efficient codes defined over partial permutations.