Name
Abstract | ||
|---|---|---|
The original motivation for identifying codes comes from fault diagnosis in multiprocessor systems. Currently, the subject forms a topic of its own with several possible applications, for example, to sensor networks. In this paper, we concentrate on identification in binary Hamming spaces. We give a new lower bound on the cardinality of r-identifying codes when r=2. Moreover, by a computational method, we show that M"1(6)=19. It is also shown, using a non-constructive approach, that there exist asymptotically good (r,@?@?)-identifying codes for fixed @?=2. In order to construct (r,@?@?)-identifying codes, we prove that a direct sum of r codes that are (1,@?@?)-identifying is an (r,@?@?)-identifying code for @?=2. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.dam.2007.09.017 | Discrete Applied Mathematics |
Keywords | Field | DocType |
multiprocessor system,direct sum,computational method,binary hamming space,new bound,hamming space,lower bound,r code,fault diagnosis,non-constructive approach,original motivation,identifying code,possible application,r-identifying code,asymptotic behaviour,sensor network | Discrete mathematics,Hamming code,Combinatorics,Upper and lower bounds,Binary code,Direct sum,Cardinality,Hamming space,Asymptotic analysis,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
156 | 12 | Discrete Applied Mathematics |
Citations | PageRank | References |
11 | 0.76 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Geoffrey Exoo | 1 | 187 | 39.86 |
| Tero Laihonen | 2 | 363 | 39.39 |
| Sanna M. Ranto | 3 | 157 | 13.49 |