Motivated by a certain communication problem we show that for any integer n and for any sequence (a1,...,ak) of k = ⌈ n 2⌉ binary vectors of length n, there is a binary vector z of length n whose Hamming distance from ai is strictly bigger than k-i for all 1 ≤ i ≤ k.
|Original language||English (US)|
|Number of pages||3|
|Journal||Discrete Applied Mathematics|
|State||Published - Jul 15 1992|
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Applied Mathematics