Two families of optimal identifying codes in binary Hamming spaces
From MaRDI portal
Publication:4674500
DOI10.1109/18.995650zbMath1061.94080MaRDI 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
94C12: Fault detection; testing in circuits and networks
94B60: Other types of codes
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
On the size of identifying codes in triangle-free graphs, On identifying codes in binary Hamming spaces, On a new class of identifying codes in graphs, Constructing codes identifying sets of vertices, Codes identifying sets of vertices in random networks, New bounds on binary identifying codes, Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori, Optimal codes for strong identification, Families of optimal codes for strong identification, Paths and cycles identifying vertices in twisted cubes, Unnamed Item, Liar's domination