Name
Abstract | ||
|---|---|---|
A nonempty set of words in a binary Hamming space F^n is called an r-identifying code if for every word the set of codewords within distance r from it is unique and nonempty. The smallest possible cardinality of an r-identifying code is denoted by M"r(n). In this paper, we consider questions closely related to the open problem whether M"t"+"r(n+m)==r+3 when r=1 and t=1. We also obtain a result M"1(n+1)=0 when n-~. This bound is related to the conjecture M"1(n+1)= |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.aam.2008.06.004 | Advances in Applied Mathematics |
Keywords | Field | DocType |
result m,open problem,conjecture m,smallest possible cardinality,distance r,r-identifying code,binary hamming space f,upper bound,direct sum | Discrete mathematics,Hamming code,Combinatorics,Hamming(7,4),Direct sum,Linear code,Hamming bound,Hamming space,Hamming weight,Mathematics,Hamming graph | Journal |
Volume | Issue | ISSN |
42 | 3 | 0196-8858 |
Citations | PageRank | References |
3 | 0.46 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Geoffrey Exoo | 1 | 187 | 39.86 |
| Ville Junnila | 2 | 43 | 10.51 |
| Tero Laihonen | 3 | 363 | 39.39 |
| Sanna M. Ranto | 4 | 157 | 13.49 |