A family of distance-optimal minimal linear codes with flexible parameters (Q2202899)
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 7254101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A family of distance-optimal minimal linear codes with flexible parameters |
scientific article; zbMATH DE number 7254101 |
Statements
A family of distance-optimal minimal linear codes with flexible parameters (English)
0 references
30 September 2020
0 references
In this paper, a family of \([(q^k-1)t,ek]_q\)-codes is constructed, where \(k\ge2\) and \(e,t\in\mathbb{N}\) such that \(2\le e \le k \le t\). The weight distribution of these codes is computed, and it is shown that for some choices of their parameters, i.e. \(q^k-k< t < q^k\) and \(e=2\), are Griesmer-optimal. Since these codes satisfy the well-known Ashikhmin-Barg condition [\textit{A. Ashikhmin} and \textit{A. Barg}, IEEE Trans. Inf. Theory 44, No. 5, 2010--2017 (1998; Zbl 0932.94032)] they are minimal codes. Also, other applications for the construction of strongly regular graphs are shown.
0 references
linear codes
0 references
minimal codes
0 references
Griesmer bound
0 references
optimal codes
0 references
0 references
0.8338874578475952
0 references
0.816457986831665
0 references
0.8081383109092712
0 references
0.8078941106796265
0 references
