New identifying codes in the binary Hamming space


Let F n be the binary n-cube, or binary Hamming space of dimension n, endowed with the Hamming distance. For r ≥ 1 and x ∈ F n, we denote by Br (x) the ball of radius r and centre x. A set C ⊆ F n is said to be an r-identifying code if the sets Br (x) ∩ C , x ∈ F n, are all nonempty and distinct.We give new constructive upper bounds for the minimum… (More)
DOI: 10.1016/j.ejc.2009.03.032

5 Figures and Tables


  • Presentations referencing similar topics