On codes identifying sets of vertices in Hamming spaces
From MaRDI portal
Publication:5947251
DOI10.1023/A:1011256721935zbMath1008.94028OpenAlexW1604469657MaRDI QIDQ5947251
Iiro S. Honkala, Sanna Ranto, Tero Laihonen
Publication date: 16 October 2001
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011256721935
Bounds on codes (94B65) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60)
Related Items
Optimal codes for strong identification, Families of optimal codes for strong identification, Paths and cycles identifying vertices in twisted cubes, Constructing codes identifying sets of vertices, Unnamed Item, Optimal identification of sets of edges using 2-factors, Identification in \(\mathbb Z^2\) using Euclidean balls, Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori, New bounds on binary identifying codes, Adaptive identification in graphs, Extension of universal cycles for globally identifying colorings of cycles, On identifying codes in binary Hamming spaces, Various bounds for liar's domination number, Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes, On the size of identifying codes in binary hypercubes
