On \(q\)-ary codes with two distances \(d\) and \(d+1\) (Q2190983)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On q-ary codes with two distances d and d+1 |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(q\)-ary codes with two distances \(d\) and \(d+1\) |
scientific article |
Statements
On \(q\)-ary codes with two distances \(d\) and \(d+1\) (English)
0 references
23 June 2020
0 references
In this work, the authors consider \(q\)-ary block codes with two distances (\(d\) and \(d+1\)). They present several constructions of such codes. In the linear case, the authors show that all codes can be obtained by a simple modification of linear equidistant codes. They derive upper bounds for the maximum cardinality of such codes. Also, they present tables of lower and upper bounds for small values of \(q\) and \(n\).
0 references
two-distance codes
0 references
equidistant codes
0 references
bounds for codes
0 references
0 references
0.885963499546051
0 references
0.8673452138900757
0 references
0.8604039549827576
0 references
0.8431103825569153
0 references
0.8321407437324524
0 references
