On the minimum length of linear codes of dimension 5
Denote \(n_q(k,d)\) the minimum length \(n\) for which there exists a \([n,k,d]_q\) linear code. A code with \(n=n_q(k,d)\) is called length optimal, and finding such codes is an important task since they are at the same time also distance and dimension optimal. In this article, the authors aim to find 5-dimensional length optimal codes.\N\NThe Griesmer number is defined as \(g_q(k,d)=\sum\limits_{i=0}^{k-1}{\left\lceil\frac{d}{q^i}\right\rceil}.\) The authors have proved that when \(q\geq 5,\) \(n_q(5, d) = g_q(5, d) + 1\) for \(3q^4-4q^3-aq + 1 \leq d \leq 3q^4 - 4q^3\) for an integer \(a\) such that \(1 \leq a \leq \lceil\frac{2}{3}q + 1\rceil.\)\N\NFurthermore, again when \(g\geq 5,\) the same equation \(n_q(5, d) = g_q(5, d) + 1\) is proven for \(2q^4-2q^3-2q^2-q+1\leq d\leq 2q^4-2q^3-2q^2.\) As a result, using previous research on the nonexistence of Griesmer codes, the nonexistence of \([g_q(5, d), 5, d]_q\) codes for 9 different cases depending on minimal distance \(d\) and field sizes \(q\) is proven.
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- A construction of two-weight codes and its applications
- A generalized extension theorem for linear codes
- A geometric approach to classifying Griesmer codes
- An extension theorem for \([n,k,d]_q\) codes with \(\gcd(d,q)=2\)
- An extension theorem for linear codes
- Construction of new Griesmer codes of dimension 5
- Geometric extending of divisible codes and construction of new linear codes
- scientific article; zbMATH DE number 67082 (Why is no real title available?)
- scientific article; zbMATH DE number 1284205 (Why is no real title available?)
- scientific article; zbMATH DE number 1795248 (Why is no real title available?)
- scientific article; zbMATH DE number 2109875 (Why is no real title available?)
- Non-existence of some 4-dimensional Griesmer codes over finite fields
- Nonexistence of a[\(g_q(5,d),5,d]_q\) code for \(3q^4-4q^3-2q+1\leqslant d\leqslant 3q^4-4q^3-q\)
- Nonexistence of linear codes meeting the Griesmer bound
- Nonexistence of some Griesmer codes over \(\mathbb{F}_q\)
- On optimal linear codes of dimension 4
- On optimal non-projective ternary linear codes
- On the achievement of the Griesmer bound
- On the construction of Griesmer codes of dimension 5
- On the geometric constructions of optimal linear codes
- On the minimum length of \(q\)-ary linear codes of dimension four
- On the minimum length of linear codes over the field of 9 elements
- On the minimum length of some linear codes of dimension 5
- On the minimum size of some minihypers and related linear codes
- On the nonexistence of q-ary linear codes of dimension five
This page was built for publication: On the minimum length of linear codes of dimension 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658055)
