scientific article
From MaRDI portal
Publication:3947676
zbMath0487.05013MaRDI QIDQ3947676
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
packingfinite projective geometryfractional factorial designserror correcting codesfinite vector spacet-linearly independent subsets
Other designs, configurations (05B30) Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of packing and covering (05B40)
Related Items (8)
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 ⋮ Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes ⋮ 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 ⋮ A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs ⋮ A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry] ⋮ A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound] ⋮ 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 ⋮ On linear codes which attain the Solomon-Stiffler bound
This page was built for publication:
