A4 Article in conference proceedings
On codes that call identify vertices in graphs




List of Authors: Cohen G, Honkala I, Lobstein A, Zemor G
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
Number of pages: 1

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.


Internal Authors/Editors


Research Areas


Last updated on 2019-29-01 at 13:32