Name
Abstract | ||
|---|---|---|
It is shown that, if r⩾2, there exists an (r,⩽2)-identifying code in the infinite hexagonal mesh with density (5r+2)/((r+2)(2r+1)) for even r and (5r+1)/((r+1)(2r+1)) for odd r. The optimal density of a (1,⩽2)-identifying code in the infinite hexagonal mesh is shown to be 2/3 and the optimal densities of (1,⩽3)- and (2,⩽3)-identifying codes are shown to be 1. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.ipl.2003.09.009 | Information Processing Letters |
Keywords | Field | DocType |
Fault tolerance,Identification,Optimal code,Combinatorial problems | Graph theory,Discrete mathematics,Combinatorics,Hexagonal crystal system,Mathematics | Journal |
Volume | Issue | ISSN |
89 | 1 | 0020-0190 |
Citations | PageRank | References |
10 | 0.75 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Iiro S. Honkala | 1 | 375 | 40.72 |
| Tero Laihonen | 2 | 363 | 39.39 |