Sequences of optimal identifying codes

DOI10.1109/18.986043zbMath1071.94541OpenAlexW2150169426MaRDI QIDQ4544828

Tero Laihonen

Publication date: 4 August 2002

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

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

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (16)

Optimal codes for strong identification ⋮ On identifying codes that are robust against edge changes ⋮ Paths and cycles identifying vertices in twisted cubes ⋮ On a new class of identifying codes in graphs ⋮ On robust identification in the square and King grids ⋮ Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice ⋮ Optimal identification of sets of edges using 2-factors ⋮ Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\) ⋮ Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori ⋮ On the identification problems in products of cycles ⋮ New bounds on binary identifying codes ⋮ Improved bounds on identifying codes in binary Hamming spaces ⋮ On identifying codes in binary Hamming spaces ⋮ 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: Sequences of optimal identifying codes