On the geometric constructions of optimal linear codes
From MaRDI portal
Publication:329188
DOI10.1007/s10623-015-0167-2zbMath1396.94109OpenAlexW2231447873MaRDI QIDQ329188
Yuuki Kageyama, Tatsuya Maruta
Publication date: 21 October 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10466/15400
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial structures in finite projective spaces (51E20)
Related Items (9)
On the nonexistence of ternary linear codes attaining the Griesmer bound ⋮ Construction of new Griesmer codes of dimension 5 ⋮ On the minimum length of linear codes over \(\mathbb{F}_5\) ⋮ Unnamed Item ⋮ Nonexistence of some Griesmer codes over \(\mathbb{F}_q\) ⋮ Unnamed Item ⋮ On the minimum length of linear codes over the field of 9 elements ⋮ On optimal linear codes of dimension 4 ⋮ Nonexistence of linear codes meeting the Griesmer bound
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extension theorems for linear codes over finite fields
- On optimal ternary linear codes of dimension 6
- The non-existence of Griesmer codes with parameters close to codes of Belov type
- Nonexistence of some Griesmer codes over \(\mathbb{F}_q\)
- 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 class of optimal linear codes of length one above the Griesmer bound
- On sharply transitive sets in \(\mathrm{PG}(2,g)\).
- The correspondence between projective codes and 2-weight codes
- On the achievement of the Griesmer bound
- On the minimum size of some minihypers and related linear codes
- On the minimum length of \(q\)-ary linear codes of dimension four
- On the construction of Griesmer codes of dimension 5
- On the minimum length of some linear codes
- On the minimum length of linear codes over \(\mathbb{F}_5\)
- Parameters for which the Griesmer bound is not sharp
- On optimal non-projective ternary linear codes
- On the nonexistence of \(q\)-ary linear codes of dimension five
This page was built for publication: On the geometric constructions of optimal linear codes
