On the minimum length of linear codes over the field of 9 elements (Q521374): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 00:30, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the minimum length of linear codes over the field of 9 elements |
scientific article |
Statements
On the minimum length of linear codes over the field of 9 elements (English)
0 references
10 April 2017
0 references
Summary: We construct a lot of new \([n, 4, d]_9\) codes whose lengths are close to the Griesmer bound and prove the nonexistence of some linear codes attaining the Griesmer bound using some geometric techniques through projective geometries to determine the exact value of \(n_9(4,d)\) or to improve the known bound on \(n_9(4,d)\) for given values of \(d\), where \(n_q(k,d)\) is the minimum length \(n\) for which an \([n, k, d]_q\) code exists. We also give the updated table for \(n_9(4,d)\) for all \(d\) except some known cases.
0 references
optimal linear codes
0 references
Griesmer bound
0 references
projective dual
0 references
geometric puncturing
0 references