scientific article
From MaRDI portal
Publication:4011770
zbMath0742.94012MaRDI QIDQ4011770
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (40)
On the nonexistence of ternary linear codes attaining the Griesmer bound ⋮ Construction of new Griesmer codes of dimension 5 ⋮ On the minimum length of some linear codes ⋮ The non-existence of \((104,22;3,5)\)-arcs ⋮ New bounds for the minimum length of quaternary linear codes of dimension five ⋮ On the geometric constructions of optimal linear codes ⋮ On critical exponents of Dowling matroids ⋮ Nonexistence of some linear codes over the field of order four ⋮ Geometric extending of divisible codes and construction of new linear codes ⋮ On the minimum length of linear codes over \(\mathbb{F}_5\) ⋮ Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9 ⋮ Extension theorems for linear codes over finite fields ⋮ The geometric approach to the existence of some quaternary Griesmer codes ⋮ On the minimum length of ternary linear codes ⋮ Unnamed Item ⋮ New minimum distance bounds for linear codes over GF(5). ⋮ On codes meeting the Griesmer bound. ⋮ Unnamed Item ⋮ 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\)] ⋮ A generalized extension theorem for linear codes ⋮ Linear codes close to the Griesmer bound and the related geometric structures ⋮ Nonexistence of some ternary linear codes ⋮ On the sharpness of the Griesmer bound ⋮ On the maximum size of some \((k,r)\)-arcs in PG\((2,q)\) ⋮ A geometric construction of a \((38,2)\)-blocking set in \(\mathrm{PG}(2,13)\) and the related \([145,3,133_{13}\) code] ⋮ On optimal non-projective ternary linear codes ⋮ A new extension theorem for ternary linear codes and its application ⋮ On the minimum length of linear codes over the field of 9 elements ⋮ Optimal ternary linear codes ⋮ The nonexistence of some ternary linear codes of dimension 6 ⋮ The non-existence of Griesmer codes with parameters close to codes of Belov type ⋮ On the covering radius of Simplex codes ⋮ A class of optimal linear codes of length one above the Griesmer bound ⋮ Divisibility of codes meeting the Griesmer bound ⋮ On optimal linear codes of dimension 4 ⋮ On optimal linear codes over \(\mathbb F_5\) ⋮ Nonexistence of linear codes meeting the Griesmer bound ⋮ On the minimum length of quaternary linear codes of dimension five ⋮ On the construction of Griesmer codes of dimension 5 ⋮ Optimal linear codes over \(\mathrm{GF}(4)\)
This page was built for publication:
