Minihypers and linear codes meeting the Griesmer bound: Improvements to results of Hamada, Helleseth and Maekawa
From MaRDI portal
Publication:1598869
DOI10.1023/A:1013852330818zbMath0999.94046OpenAlexW1594612049MaRDI QIDQ1598869
Publication date: 28 May 2002
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013852330818
Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Combinatorial codes (94B25)
Related Items (7)
A weighted version of a result of Hamada on minihypers and on linear codes meeting the Griesmer bound ⋮ On the non-existence of a projective (75, 4, 12, 5) set in PG(3, 7) ⋮ Weighted \(\{\delta (q+1),\delta ;k-1,q\}\)-minihypers ⋮ A classification result on weighted \(\{\delta v_{\mu +1},\delta v_{\mu};N,p^{3}\}\)-minihypers ⋮ On weighted minihypers in finite projective spaces of square order ⋮ Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound ⋮ A characterisation result on a particular class of non-weighted minihypers
This page was built for publication: Minihypers and linear codes meeting the Griesmer bound: Improvements to results of Hamada, Helleseth and Maekawa
