Name
Abstract | ||
|---|---|---|
The authors prove combinatorial lower bounds for Kq (n,R), the minimal cardinality of any q-ary code of length n and covering radius R. Tables of lower bounds for Kq(n,R) are presented for q=3, 4, 5 |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1109/18.54887 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
combinatorial lower bounds,minimal cardinality,length n,combinatorial mathematics,q-ary code,radius r,codes,q-ary covering codes,lower bound,covering radius,mathematics,upper bound,hamming distance | Information theory,Discrete mathematics,Hamming code,Combinatorics,Combinatorial method,Upper and lower bounds,Block code,Cardinality,Hamming distance,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
36 | 3 | 0018-9448 |
Citations | PageRank | References |
15 | 1.97 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wende Chen | 1 | 15 | 1.97 |
| I. S. Honkala | 2 | 31 | 3.67 |