On a geometrical method of construction of maximal t-linearly independent sets

From MaRDI portal
Publication:1250821

DOI10.1016/0097-3165(78)90027-4zbMath0389.05022OpenAlexW2061799331MaRDI QIDQ1250821

Noboru Hamada, Fumikazu Tamari

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(78)90027-4




Related Items (32)

On the extendability of particular classes of constant dimension codesA study of \((x(q + 1), x; 2, q)\)-minihypersA weighted version of a result of Hamada on minihypers and on linear codes meeting the Griesmer boundUniqueness of \([87,5,57; 3\)-codes and the nonexistence of \([258,6,171; 3]\)-codes] ⋮ A characterization of some \(\{ 3v_ 2+v_ 3,3v_ 1+v_ 2; 3,3\}\)-minihypers and some \([15,4,9; 3\)-codes with \(B_ 2=0\)] ⋮ A characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers and its applications to error-correcting codesCharacterization 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 geometryCharacterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codesCharacterization 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 codesA characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designsA note on the construction of optimal linear codesA characterization of \(\{ 2\upsilon{}_{\alpha{}+1}+2\upsilon{}_{\beta{}+1},2\upsilon_ \alpha{}+2\upsilon{}_ \beta{} ;t,q\}\)-minihypers in PG\((t,q)(t\geq 2,q\geq 5\) and \(0\leq\alpha{}<\beta{}<t)\) and its applications to error- correcting codesWeighted \(\{\delta (q+1),\delta ;k-1,q\}\)-minihypersA characterization of some \(\{2v_{\alpha{}+1}+v_{\gamma{}+1},2v_ \alpha{}+v_ \gamma{};k-1,3\}\)-minihypers and some \((n,k,3^{k-1}- 2\cdot{}3^ \alpha{}-3^ \gamma{};3)\)-codes \((k\geq{}3,\;0 \leq{}\alpha{}< \gamma{}< k-1)\) meeting the Griesmer boundProjective codes meeting the Griesmer boundOn the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q\)-codes meeting the Griesmer bound] ⋮ A characterization of some \(\{v_ 2+2v_ 3,v_ 1+2v_ 2;k-1,3\}\)-minihypers and some \((v_ k-30,k,3^{k-1}-21;3)\)-codes meeting the Griesmer boundOptimal fractional factorial plans using minihypersA classification result on weighted \(\{\delta v_{\mu +1},\delta v_{\mu};N,p^{3}\}\)-minihypersA 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] ⋮ Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer boundTight sets, weighted \(m\)-covers, weighted \(m\)-ovoids, and minihypersA 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 geometryA Griesmer bound for linear codes over finite quasi-Frobenius ringsA characterisation result on a particular class of non-weighted minihypersArcs, blocking sets, and minihypersThe packing problem for projective geometries over GF(3) with dimension greater than fiveOn the nonexistence of some quaternary linear codes meeting the Griesmer boundThe nonexistence of ternary [79, 6, 51 codes] ⋮ A characterization of some minihypers in a finite projective geometry PG(t,4)On a particular class of minihypers and its applications. III: Applications



Cites Work


This page was built for publication: On a geometrical method of construction of maximal t-linearly independent sets