New identifying codes in the binary Hamming space

DOI10.1016/j.ejc.2009.03.032zbMath1198.94175OpenAlexW1984096349MaRDI QIDQ966160

Olivier Hudry, Irène Charon, Gérard D. Cohen, Antoine C. Lobstein

Publication date: 27 April 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.032

zbMATH Keywords

identifying codescode constructionupper bounds for codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05)

Related Items (16)

More results on the complexity of identifying problems in graphs ⋮ Bounds on r-identifying codes in q-ary Lee space ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ Identifying Codes in Line Graphs ⋮ On regular and new types of codes for location-domination ⋮ Partial linear spaces and identifying codes ⋮ Locating and identifying codes in circulant networks ⋮ r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube ⋮ Improved bounds on identifying codes in binary Hamming spaces ⋮ On binary linear \(r\)-identifying codes ⋮ Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes ⋮ Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code ⋮ Upper bounds for binary identifying codes ⋮ Locating-Domination and Identification ⋮ Improved lower bound for locating-dominating codes in binary Hamming spaces ⋮ Identifying codes and searching with balls in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On identifying codes in binary Hamming spaces
• New bounds on binary identifying codes
• On the complexity of the identification problem in Hamming spaces
• Monotonicity of the minimum cardinality of an identifying code in the hypercube
• Improved Upper Bounds on Binary Identifying Codes
• On a new class of codes for identifying vertices in graphs
• Bounds on identifying codes
• The noising methods: A generalization of some metaheuristics
• Identifying codes with small radius in some infinite regular graphs

This page was built for publication: New identifying codes in the binary Hamming space