Improved Upper Bounds on Binary Identifying Codes

DOI10.1109/TIT.2007.907434MaRDI QIDQ3549076zbMATH OpenFDO

Authors Geoffrey Exoo, Tero Laihonen, Sanna Ranto

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/TIT.2007.907434

Mathematics Subject Classification ID

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

Cited in

(11)

• Upper bounds for binary identifying codes
• Constructions of r-identifying codes and (r, l)-identifying codes
• Locating-domination and identification
• Links Between Discriminating and Identifying Codes in the Binary Hamming Space
• On binary linear \(r\)-identifying codes
• On Iiro Honkala's contributions to identifying codes
• Linear and group identifying codes in Hamming graphs
• Locating-dominating codes: bounds and extremal cardinalities
• New bounds on binary identifying codes
• Improved bounds on identifying codes in binary Hamming spaces
• New identifying codes in the binary Hamming space

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549076)