Linear codes close to the Griesmer bound and the related geometric structures

DOI10.1007/s10623-018-0565-3zbMath1443.94114OpenAlexW2895099999WikidataQ129128197 ScholiaQ129128197MaRDI QIDQ670207

Assia Rousseva, Ivan N. Landgev

Publication date: 18 March 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-018-0565-3

zbMATH Keywords

Griesmer boundarcsminihypersoptimal linear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Linear codes and caps in Galois spaces (51E22) Blocking sets, ovals, (k)-arcs (51E21)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A study of \((xv_t, xv_{t-1})\)-minihypers in \(\mathrm{PG}(t,q)\)
• Codes and projective multisets
• On the achievement of the Griesmer bound
• On codes meeting the Griesmer bound.
• On the non-existence of linear codes attaining the Griesmer bound
• Parameters for which the Griesmer bound is not sharp
• Fundamentals of Error-Correcting Codes
• Algebraically punctured cyclic codes
• A Bound for Error-Correcting Codes
• On \(q^2+q+2, q+2\)-arcs in the projective plane \(PG(2,q)\)

This page was built for publication: Linear codes close to the Griesmer bound and the related geometric structures