Algorithms of self-synchronizing single-deletion-correcting codes
Abstract
This study explores the self-synchronization problem in DNA coding, specifically addressing single-deletion errors without using delimiters between codewords. We aim to identify the beginning of each codeword without using delimiters, enhancing the transmission efficiency. The motivation arises from the inefficiency of adding meaningless symbols as delimiters, decreasing the information rate. In addition, the historical context in biology, specifically Francis Crick's proposal of ``codes without commas'' for DNA sequences, inspires this investigation. We introduce a novel approach for correcting single-deletion errors in continuous transmissions without delimiters, distinguishing the beginning and end of each codeword. This approach is based on the properties of complementary information set codes, which is used to present an algorithm for single-deletion correcting codes with self-synchronizing capability. Accordingly, we present encoding and decoding algorithms for self-synchronizing single-deletion correcting DNA codes with concrete examples.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.