Eitan Yaakobi

Repeat-Free Codes.

2019 · arXiv (Cornell University)

In this paper we consider the problem of encoding data into \textit{repeat-free} sequences in which sequences are imposed to contain any $k$-tuple at most once (for predefined $k$). First, the capacity of the repeat-free constraint …