Table of Contents
Fetching ...

Algorithms of self-synchronizing single-deletion-correcting codes

Whan-Hyuk Choi

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 {\it complementary information set codes}, which is used to present an algorithm for {\it 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.

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 {\it complementary information set codes}, which is used to present an algorithm for {\it 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.

Paper Structure

This paper contains 7 sections, 5 theorems, 32 equations, 1 table, 4 algorithms.

Key Result

Lemma 1

CGKS If a $[2n,n]$ code ${\mathcal{C}}$ over ${\mathbb F}_q$ has generator matrix $(I\mid A)$ with $A$ invertible, then ${\mathcal{C}}$ is a CIS code with the systematic partition. Conversely, every CIS code is equivalent to a code with generator matrix in that form.

Theorems & Definitions (18)

  • Lemma 1
  • Example 2
  • Theorem 3
  • Example 4
  • Remark 5
  • Definition 7
  • Definition 8
  • Definition 9
  • Theorem 10
  • proof
  • ...and 8 more