Abstract
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 B r ( 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 B r ( x ) ∩ C , x ∈ F n , are all nonempty and distinct. We give new constructive upper bounds for the minimum cardinalities of r -identifying codes in the Hamming space.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
