On robust and dynamic identifying codes
I Honkala, MG Karpovsky… - IEEE Transactions on …, 2006 - ieeexplore.ieee.org
I Honkala, MG Karpovsky, LB Levitin
IEEE Transactions on Information Theory, 2006•ieeexplore.ieee.orgA subset C of vertices in an undirected graph G=(V, E) is called a 1-identifying code if the
sets I (v)={u/spl isin/C: d (u, v)/spl les/1}, v/spl isin/V, are nonempty and no two of them are
the same set. It is natural to consider classes of codes that retain the identification property
under various conditions, eg, when the sets I (v) are possibly slightly corrupted. We consider
two such classes of robust codes. We also consider dynamic identifying codes, ie, walks in G
whose vertices form an identifying code in G.
sets I (v)={u/spl isin/C: d (u, v)/spl les/1}, v/spl isin/V, are nonempty and no two of them are
the same set. It is natural to consider classes of codes that retain the identification property
under various conditions, eg, when the sets I (v) are possibly slightly corrupted. We consider
two such classes of robust codes. We also consider dynamic identifying codes, ie, walks in G
whose vertices form an identifying code in G.
A subset C of vertices in an undirected graph G=(V,E) is called a 1-identifying code if the sets I(v)={u/spl isin/C:d(u,v)/spl les/1}, v/spl isin/V, are nonempty and no two of them are the same set. It is natural to consider classes of codes that retain the identification property under various conditions, e.g., when the sets I(v) are possibly slightly corrupted. We consider two such classes of robust codes. We also consider dynamic identifying codes, i.e., walks in G whose vertices form an identifying code in G.
ieeexplore.ieee.org
Showing the best result for this search. See all results