Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.jcta.2007.12.009 | J. Comb. Theory, Ser. A |
Keywords | Field | DocType |
identifying codes,new code,perfect codes,various engineering application,fault-detection,adaptive version,regular graph,graph theory,square grid,adaptive identification,classical non-adaptive case,fault detection | Online codes,Hamming code,Discrete mathematics,Combinatorics,Luby transform code,Block code,Turbo code,Expander code,Theoretical computer science,Reed–Muller code,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
115 | 7 | Journal of Combinatorial Theory, Series A |
Citations | PageRank | References |
3 | 0.42 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Y. Ben-Haim | 1 | 140 | 8.29 |
| Sylvain Gravier | 2 | 486 | 59.01 |
| Antoine Lobstein | 3 | 718 | 89.14 |
| Julien Moncel | 4 | 191 | 17.33 |