Name
Abstract | ||
|---|---|---|
The minimum size of a binary code with length n and covering radius R is denoted by K(n, R). For arbitrary R, the value of K(n, R) is known when n ≤ 2R + 3, and the corresponding optimal codes have been classified up to equivalence. By combining combinatorial and computational
methods, several results for the first open case, K(2R + 4, R), are here obtained, including a proof that K(10, 3) = 12 with 11481 inequivalent optimal codes and a proof that if K(2R + 4, R) R then this inequality cannot be established by the existence of a corresponding self-complementary code. |
Year | DOI | Venue |
|---|---|---|
2008 | https://doi.org/10.1007/s10623-007-9156-4 | Designs, Codes and Cryptography |
Keywords | Field | DocType |
Bounds on codes,Classification,Covering code,Covering radius,94B75,94B25,94B65 | Discrete mathematics,Combinatorics,Covering code,Binary code,Equivalence (measure theory),Mathematics | Journal |
Volume | Issue | ISSN |
48 | 2 | 0925-1022 |
Citations | PageRank | References |
1 | 0.43 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gerzson Kéri | 1 | 46 | 5.09 |
| Patric R. J. Östergård | 2 | 609 | 70.61 |