Improved Upper Bounds on Binary Identifying Codes

DOI10.1109/TIT.2007.907434zbMath1326.94141MaRDI QIDQ3549076

Geoffrey Exoo, Sanna Ranto, Tero Laihonen

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Bounds on codes (94B65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other types of codes (94B60)

Related Items (9)

Locating-dominating codes: bounds and extremal cardinalities ⋮ Links Between Discriminating and Identifying Codes in the Binary Hamming Space ⋮ New bounds on binary identifying codes ⋮ Improved bounds on identifying codes in binary Hamming spaces ⋮ New identifying codes in the binary Hamming space ⋮ On binary linear \(r\)-identifying codes ⋮ Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes ⋮ Upper bounds for binary identifying codes ⋮ Locating-Domination and Identification

This page was built for publication: Improved Upper Bounds on Binary Identifying Codes