Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods

In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number $r$ of repetitions, in the sense that no two strings in the code can give rise to the same string after $r$ repetitions. We propose explicit number theore...

Full description