Name
Abstract | ||
|---|---|---|
The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. Their motivation for identification came from finding malfunctioning processors in multiprocessor systems. Besides that identifying codes can also be applied to sensor networks. In this paper we consider identifying codes in Hamming spaces. We first concentrate on improving the lower bounds on codes which identify words within distance r > 1. These improvements are achieved using a new approach. Then we proceed by introducing new lower bounds on codes identifying sets of words. Constructions for such codes with the best known cardinalities are also given. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ISIT.2008.4595062 | Toronto, ON |
Keywords | Field | DocType |
Hamming codes,binary codes,multiprocessing systems,Hamming spaces,binary identifying codes,multiprocessor systems,sensor networks | Online codes,Discrete mathematics,Hamming code,Luby transform code,Computer science,Upper and lower bounds,Block code,Binary code,Turbo code,Theoretical computer science,Linear code | Conference |
ISBN | Citations | PageRank |
978-1-4244-2257-9 | 0 | 0.34 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Geoffrey Exoo | 1 | 187 | 39.86 |
| Ville Junnila | 2 | 0 | 0.68 |
| Tero Laihonen | 3 | 0 | 0.68 |
| Ranto, S. | 4 | 0 | 0.68 |