A4 Refereed article in a conference publication
On codes that call identify vertices in graphs
Authors: Cohen G, Honkala I, Lobstein A, Zemor G
Editors: -
Publication year: 2000
Journal: IEEE International Symposium on Information Theory
Book title : Proceedings 2000 International Symposium on Information Theory
Journal name in source: 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS
First page : 11
Last page: 11
Number of pages: 1
ISBN: 0-7803-5858-9
DOI: https://doi.org/10.1109/ISIT.2000.866301
Abstract
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.
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.
UTU Research Portal