Motivated by a certain communication problem we show that for any integer n and for any sequence (a1,...,a(k)) of k = [n/2] binary vectors of length n, there is a binary Vector z of length n whose Hamming distance from a(i) is strictly bigger than k-i for all 1 less-than-or-equal-to i less-than-or-equal-to k.