Nonexistence of some Griesmer codes over F_q

DOI10.1016/J.DISC.2015.09.030MaRDI QIDQ898102zbMATH OpenOpenAlexFDO

Authors Kazuki Kumegawa, Tatsuya Maruta

Publication date 8 December 2015

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2015.09.030

zbMATH Keywords

Griesmer boundoptimal linear codesminihyperarcs in \(\mathrm{PG}(r, q)\)

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05)

Recommendations

• Non-existence of some 4-dimensional Griesmer codes over finite fields
• On the nonexistence of some quaternary linear codes meeting the Griesmer bound
• scientific article; zbMATH DE number 1047546
• The non-existence of Griesmer codes with parameters close to codes of Belov type
• Nonexistence of linear codes meeting the Griesmer bound
• On the non-existence of linear codes attaining the Griesmer bound
• On the nonexistence of \(g\)-ary linear codes attaining the Griesmer bound.
• scientific article; zbMATH DE number 1189046
• The nonexistence of a \([207,4,165]\) code over \(GF(5)\)
• Nonexistence of \([n,5,d]_q\) codes attaining the Griesmer bound for \(q^4-2q^2-2q+1\leq d\leq q^4-2q^2-q\).

Cites work

• scientific article; zbMATH DE number 1189050 (Why is no real title available?)
• scientific article; zbMATH DE number 53569 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 1795248 (Why is no real title available?)
• A class of optimal linear codes of length one above the Griesmer bound
• A geometric approach to classifying Griesmer codes
• A study of \((xv_t, xv_{t-1})\)-minihypers in \(\mathrm{PG}(t,q)\)
• Construction of optimal linear codes by geometric puncturing
• On codes meeting the Griesmer bound.
• On optimal linear codes over \(\mathbb F_8\)
• On optimal non-projective ternary linear codes
• 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 quaternary linear codes of dimension five
• On the minimum length of some linear codes
• On the nonexistence of \(q\)-ary linear codes of dimension five
• The non-existence of Griesmer codes with parameters close to codes of Belov type

Cited in

(14)

• Construction of new Griesmer codes of dimension 5
• 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\)
• On the nonexistence of \(g\)-ary linear codes attaining the Griesmer bound.
• On the minimum length of linear codes of dimension 5
• Non-existence of some 4-dimensional Griesmer codes over finite fields
• Nonexistence of \([g_{q}(6,d),6,d]_{q}\) codes for \(4q^{5}-5q^{4}-2q+1\leq d \leq 4q^{5}-5q^{4}-q\)
• Nonexistence of some quantum jump codes with specified parameters
• On optimal linear codes of dimension 4
• Nonexistence of linear codes meeting the Griesmer bound
• New upper bounds and constructions of multi-erasure locally recoverable codes
• scientific article; zbMATH DE number 1189046 (Why is no real title available?)
• On the minimum length of linear codes over the field of 9 elements
• On the geometric constructions of optimal linear codes
• On the construction of optimal linear codes of dimension four

This page was built for publication: Nonexistence of some Griesmer codes over \(\mathbb{F}_q\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898102)