Name
Abstract | ||
|---|---|---|
A novel method for constructing normal binary nonlinear covering codes is presented. The construction improves several upper bounds on K(n,R), the minimum cardinality of a binary code of length n and covering radius R |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1109/18.21265 | IEEE Transactions on Information Theory - Part 1 |
Keywords | Field | DocType |
boundary-value problems,codes,encoding,construction,normal binary nonlinear covering codes,upper bounds | Discrete mathematics,Hamming code,Combinatorics,Group code,Covering code,Low-density parity-check code,Block code,Expander code,Reed–Muller code,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
34 | 5 | 0018-9448 |
Citations | PageRank | References |
8 | 0.92 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| I. S. Honkala | 1 | 31 | 3.67 |
| H. O. Hamalainen | 2 | 51 | 6.55 |