On codes with given minimum distance and covering radius (Q6483300)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1505644
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On codes with given minimum distance and covering radius |
scientific article; zbMATH DE number 1505644 |
Statements
0 references
0.87173283
0 references
0.8570459
0 references
0.85382915
0 references
0 references
0 references
On codes with given minimum distance and covering radius (English)
0 references
covering code
0 references
error-correcting code
0 references
nonlinear code
0 references
minimum distance
0 references
lower bound for covering codes
0 references
In the study of codes, one usually focuses on one important parameter, such as minimum distance or covering radius. In the current work, however, both of these parameters are simultaneously studied. Very little has been done in this direction earlier, complete caps forming a notable exception (complete caps are linear codes with minimum distance 4 and covering radius 2). Let \(K_q(n,R,d)\) denote the minimum size of a \(q\)-ary code of length \(n\), covering radius at most \(R\), and minimum distance at least \(d\). The paper contains some basic results regarding \(K_q(n,d-1,d)\). The existence of parameters for which \(K_q(n,1,2)>K_q(n,1,1)\) is stated as an open question. However, such parameters exist; for example, the unique optimal binary code of length 5 and covering radius 1 has minimum distance 1 (due to \textit{R. Stanton} and \textit{J. Kalbfleisch} [Aequationes Math. 1, 94-103 (1968; Zbl 0159.03004)]). Another open problem mentioned in the paper, the value of \(K_4(4,1,2)\), has later been settled by the reviewer, the author, and A. Wassermann: \(K_4(4,1,2)=28\) with two inequivalent optimal codes (whereas \(K_4(4,1,1)=24\)). A new lower bound for covering codes with covering radius 1 is also presented in the current paper. Reviewer's remark: The article has been replaced by a later version published in Beitr. Algebra Geom. 42, No. 2, 601-611 (2001).
0 references