Name
Abstract | ||
|---|---|---|
In this paper, we consider identifying codes in binary Hamming spaces F^n, i.e., in binary hypercubes. The concept of (r,=~1nlog"2M"r^(^==1 when @r@?[0,1/2). We also show that M"r^(^= |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.jcta.2009.02.004 | Journal of Combinatorial Theory Series A |
Keywords | DocType | Volume |
binary Hamming spaces F,binary hypercubes | Journal | 116 |
Issue | ISSN | Citations |
5 | 0097-3165 | 4 |
PageRank | References | Authors |
0.42 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Svante Janson | 1 | 1009 | 149.67 |
| Tero Laihonen | 2 | 363 | 39.39 |