Adaptive identification in graphs

Authors:
Yael Ben-Haim;Sylvain Gravier;Antoine Lobstein;Julien Moncel
Affiliations:
Department of Electrical Engineering Systems, Tel Aviv University, Tel Aviv 69978, Israel;Institut Fourier, ERTé “maths à modeler”, 100 rue des Maths, 38402 Saint Martin d'Hères, France;CNRS, LTCI UMR 5141, ENST, Département INFRES, 46 rue Barrault, 75634 Paris Cedex 13, France;INPG, Laboratoire Leibniz, ERTé “maths à modeler”, Groupe de recherche GéoD, 46 avenue Félix Viallet, 38031 Grenoble Cedex, France
Venue:
Journal of Combinatorial Theory Series A
Year:
2008

Citing 6
Cited 1

On Codes Identifying Sets of Vertices in Hamming Spaces

Designs, Codes and Cryptography
Codes Identifying Sets of Vertices

AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On identification in the triangular grid

Journal of Combinatorial Theory Series B
Exact Minimum Density of Codes Identifying Vertices in the Square Grid

SIAM Journal on Discrete Mathematics
On a new class of codes for identifying vertices in graphs

IEEE Transactions on Information Theory
Robust location detection with sensor networks

IEEE Journal on Selected Areas in Communications

Identification in Z2 using Euclidean balls

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An adaptive version of identifying codes is introduced. These codes are motivated by various engineering applications. Bounds on adaptive identifying codes are given for regular graphs and torii in the square grid. The new codes are compared to the classical non-adaptive case.