On the complexity of the identification problem in Hamming spaces

DOI10.1007/s00236-002-0093-4zbMath1034.68043OpenAlexW2086369385MaRDI QIDQ1403334

Iiro S. Honkala, Antoine C. Lobstein

Publication date: 1 September 2003

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-002-0093-4

zbMATH Keywords

Hamming distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

More results on the complexity of identifying problems in graphs ⋮ Bounds on r-identifying codes in q-ary Lee space ⋮ Links Between Discriminating and Identifying Codes in the Binary Hamming Space ⋮ r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube ⋮ New identifying codes in the binary Hamming space ⋮ On identifying codes in binary Hamming spaces ⋮ Locating-Domination and Identification ⋮ On identification in the triangular grid

This page was built for publication: On the complexity of the identification problem in Hamming spaces