SIAMDM
2010
13 years 10 months ago
2010
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 th...