On codes that call identify vertices in graphs

: Cohen G, Honkala I, Lobstein A, Zemor G

: -

: 2000

IEEE International Symposium on Information Theory

: Proceedings 2000 International Symposium on Information Theory

: 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS

: 11

: 1

: 0-7803-5858-9

DOI: https://doi.org/10.1109/ISIT.2000.866301

In a graph G = (V, E), a subset of vertices C (= code) is called t-identifying if for all v epsilon V the sets B-t(v) boolean AND C consisting of all elements of C within distance t from v are nonempty and different. We study some properties of these codes.

Mathematics