Abstract
Sometimes the difference between two distinct words of the same length cannot be smaller than a certain minimal amount. In particular if two distinct words of the same length are both periodic or quasiperiodic, then their Hamming distance is at least 2. We study here how the minimum Hamming distance dist(x, y) between two words x, y of the same length n depends on their periods. Similar problems were considered in [1] in the context of quasiperiodicities. We say that a period p of a word x is primitive if x does not have any smaller period p ' which divides p. For integers p, n (p <= n) we define P-p(n) as the set of words of length n with primitive period p. We show several results related to the following functions introduced in this paper for p not equal q and n >= max(p,q).
D-p,D-q(n) = min {dist(x, y) : x is an element of P-p(n), y is an element of P-q(n)},
N-p,N-q(h) = max {n : D-p,D-q(n) <= h}.