A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
type: Item
instance of: scholarly article
title: A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
zbMATH Open document ID: 0770.94006
DOI: 10.1016/0012-365X(93)90404-H
author: Noboru Hamada
published in: Discrete Mathematics
publication date: 1993-09-13T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 51E20
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 219086
zbMATH Keywords: minihyper
zbMATH Keywords: finite projective geometry
zbMATH Keywords: hyperplanes
zbMATH Keywords: Griesmer bound
MaRDI profile type: Publication
cites work: Q3236264
cites work: A note on the Griesmer bound (Corresp.)
cites work: Q4081121
cites work: Q5796828
cites work: Q3285034
cites work: Q5842117
cites work: On a class of error correcting binary group codes
cites work: Further results on error correcting binary group codes
cites work: On a Bound Useful in the Theory of Factorial Designs and Error Correcting Codes
cites work: Arcs and blocking sets. II
cites work: Orthogonal Arrays of Index Unity
cites work: Q5770541
cites work: On the uniqueness of \((q+1)_ 4\)-arcs of \(PG(4,q),q=2^ h,h\vee\)
cites work: Q5545191
cites work: Some maximal arcs in finite projective planes
cites work: New bounds on binary linear codes of dimension eight (Corresp.)
cites work: Q5842943
cites work: Q5836519
cites work: Q5836520
cites work: The non-classical 10-arc of PG(4,9)
cites work: A Bound for Error-Correcting Codes
cites work: On maximal \(t\)-linearly independent sets
cites work: Maximal sets of points in finite projective space, no t-linearly dependent
cites work: Characterization of \(\{(q+1)+2,1;t,q\}-\min \cdot hypers\) and \(\{2(q+1)+2,2;2,q\}-\min \cdot hypers\) in a finite projective geometry
cites work: Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes
cites work: Characterization of \(\{2(q+1)+2,2;t,q\}\)-\(\min \cdot hypers\) in PG(t,q) (t\(\geq 3,q\geq 5)\) and its applications to error-correcting codes
cites work: Q3813825
cites work: A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry
cites work: A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs
cites work: Q1182872
cites work: A characterization of some \(\{3v_{\mu+ 1}, 3v_ \mu; k-1, q\}\)-minihypers and some \([n, k, q^{k-1}- 3q^ \mu; q]\)-codes \((k\geq 3\), \(q\geq 5\), \(1\leq \mu< k-1)\) meeting the Griesmer bound
cites work: Q1197005
cites work: Q3136944
cites work: A characterization of some minihypers in a finite projective geometry PG(t,4)
cites work: Q3993697
cites work: Q4027639
cites work: Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\)
cites work: Q4201552
cites work: On a geometrical method of construction of maximal t-linearly independent sets
cites work: Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming
cites work: Construction of optimal linear codes using flats and spreads in a finite projective geometry
cites work: Error Detecting and Error Correcting Codes
cites work: A characterization of codes meeting the Griesmer bound
cites work: New constructions of codes meeting the Griesmer bound
cites work: A new class of codes meeting the Griesmer bound
cites work: Caps and codes
cites work: Q3801474
cites work: Q3851217
cites work: Q5683869
cites work: Q4146667
cites work: A vector-space packing problem
cites work: Q3342348
cites work: Q5514074
cites work: Lower bounds on \(m_t(r,s)\)
cites work: Q5628809
cites work: On the uniqueness of the Golay codes
cites work: Q3290963
cites work: Q5815962
cites work: Q5627526
cites work: Q5787292
cites work: Q5589782
cites work: Algebraically punctured cyclic codes
cites work: A note on the construction of optimal linear codes

A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (cites work)
cites work: Q3947676

A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (cites work)
cites work: On linear codes which attain the Solomon-Stiffler bound

A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (cites work)
cites work: Some results concerning \(\{(q+1)(n-1);\;n\}\)-arcs and \(\{(q+1)\;(n-1)+1;\;n\}\)-arcs in finite projective planes of order \(q\)

A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (cites work)
cites work: On the Nonexistence of Perfect Codes over Finite Fields

A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (cites work)
cites work: Q5612989

A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (cites work)
cites work: On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound

A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (cites work)
cites work: Q3250141

A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (cites work)
cites work: Q5342264

A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (cites work)
cites work: Q5599179

A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (cites work)
cites work: Q4894967