# Technical Program

## Paper Detail

Paper Title Repeat-Free Codes TU2.R5.4 Ohad Elishco, Massachusetts Institute of Technology, United States; Ryan Gabrys, Spawar Systems center, United States; Muriel Médard, Massachusetts Institute of Technology, United States; Eitan Yaakobi, Technion - Israel Institute of Technology, Israel Information Theory in Biology II Saint Victor, Level 3 Tuesday, 09 July, 11:40 - 13:00 Tuesday, 09 July, 12:40 - 13:00 Click here to download the manuscript 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 and redundancy of the repeat-free constraint are calculated. Then, an efficient algorithm, which uses a single bit of redundancy, is presented to encode length-$n$ sequences for $k=2+2\log n$. This algorithm is then improved to support any value of $k$ of the form $k=a\log n$, for \$1