New results on codes with covering radius 1 and minimum distance \(2\) (Q1781002): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 05:39, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New results on codes with covering radius 1 and minimum distance \(2\) |
scientific article |
Statements
New results on codes with covering radius 1 and minimum distance \(2\) (English)
0 references
15 June 2005
0 references
The minimum possible cardinality of a \(q\)-ary code of length \(n\) and covering radius \(R\) (and minimum distance \(d\)) is denoted by \(K_q(n,R)\) (respectively \(K_q(n,R,d)\)). In the paper under review the authors consider the first (in lexicographic order with respect to \((n,q)\)) case where the inequality in \(K_q(n,R,d) \geq K_q(n,R)\) is strict. Namely, they proved that \(K_4(4,1,2)=28\) while one has \(K_4(4,1)=24\). The nonexistence result for cardinality 24 is combinatorial and the others are computational.
0 references
covering radius
0 references
codes
0 references
minimum distance
0 references