Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound

DOI10.3934/AMC.2008.2.261zbMath1209.05039OpenAlexW2012341801MaRDI QIDQ629769

Klaus Metsch, Storme, L., Jan De Beule

Publication date: 10 March 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2008.2.261

zbMATH Keywords

Griesmer boundblocking setsminihypers

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21) Combinatorial structures in finite projective spaces (51E20)

Related Items (5)

On the extendability of quasidivisible Griesmer arcs ⋮ The Use of Blocking Sets in Galois Geometries and in Related Research Areas ⋮ Unnamed Item ⋮ Galois geometries and coding theory ⋮ A characterisation result on a particular class of non-weighted minihypers

This page was built for publication: Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound