# Zero-Error Capacity of Duplication Channels

**Authors:** Mladen Kova\v{c}evi\'c

arXiv: 1902.06275 · 2020-08-13

## TL;DR

This paper investigates the zero-error capacity of duplication channels, including models inspired by DNA storage, and constructs optimal codes to achieve error-free communication at maximum rates.

## Contribution

It determines the zero-error capacity for duplication channels with various parameters and provides constructions for optimal error-correcting codes.

## Key findings

- Zero-error capacity is explicitly calculated for different duplication parameters.
- Optimal codes are constructed for error correction in duplication channels.
- The models are relevant to DNA-based data storage systems.

## Abstract

This paper is concerned with the problem of error-free communication over the i.i.d. duplication channel which acts on a transmitted sequence $ x_1 \cdots x_n $ by inserting a random number of copies of each symbol $ x_i $ next to the original symbol. The random variables representing the numbers of inserted copies at each position $ i $ are independent and take values in $ \{0, 1, \ldots, r\} $, where $ r $ is a fixed parameter. A more general model in which blocks of $ \ell $ consecutive symbols are being duplicated, and which is inspired by DNA-based data storage systems wherein the stored molecules are subject to tandem-duplication mutations, is also analyzed. A construction of optimal codes correcting all patterns of errors of this type is described, and the zero-error capacity of the duplication channel---the largest rate at which information can be transmitted through it in an error-free manner---is determined for each $ \ell $ and $ r $.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1902.06275/full.md

## Figures

5 figures with captions in the complete paper: https://tomesphere.com/paper/1902.06275/full.md

## References

25 references — full list in the complete paper: https://tomesphere.com/paper/1902.06275/full.md

---
Source: https://tomesphere.com/paper/1902.06275