Two families of optimal identifying codes in binary Hamming spaces

DOI10.1109/18.995650zbMath1061.94080OpenAlexW2160118466MaRDI QIDQ4674500

Sanna Ranto, Tero Laihonen, Iiro S. Honkala

Publication date: 11 May 2005

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

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

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (12)

Optimal codes for strong identification ⋮ Families of optimal codes for strong identification ⋮ Paths and cycles identifying vertices in twisted cubes ⋮ On a new class of identifying codes in graphs ⋮ Constructing codes identifying sets of vertices ⋮ Unnamed Item ⋮ Codes identifying sets of vertices in random networks ⋮ Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori ⋮ On the size of identifying codes in triangle-free graphs ⋮ New bounds on binary identifying codes ⋮ On identifying codes in binary Hamming spaces ⋮ Liar's domination

This page was built for publication: Two families of optimal identifying codes in binary Hamming spaces