| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656088 | Journal of Combinatorial Theory, Series A | 2008 | 13 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
