Name
Abstract | ||
|---|---|---|
The minimal cardinality of a q-ary code of length n and covering radius at most R is denoted by Kq(n, R); if we have the additional requirement that the minimum distance be at least d, it is denoted by Kq(n, R, d). Obviously, Kq(n, R, d) = Kq(n, R). In this paper, we study instances for which Kq(n,1,2) > Kq(n, 1) and, in particular, determine K4(4,1,2)=28 > 24=K4(4,1). |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10623-005-6404-3 | Des. Codes Cryptography |
Keywords | Field | DocType |
coding theory, covering radius, minimum distance, quaternary codes, complete classification | Information theory,Discrete geometry,Discrete mathematics,Data structure,Combinatorics,Covering code,Cardinality,Error detection and correction,Mathematics | Journal |
Volume | Issue | ISSN |
35 | 2 | 0925-1022 |
Citations | PageRank | References |
4 | 1.02 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patric R. J. Östergård | 1 | 609 | 70.61 |
| Jörn Quistorff | 2 | 29 | 5.72 |
| Alfred Wassermann | 3 | 125 | 23.33 |