On linear codes which attain the Solomon-Stiffler bound
From MaRDI portal
Publication:798293
DOI10.1016/0012-365X(84)90116-XzbMATH Open0545.94013MaRDI QIDQ798293FDOQ798293
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- On linear rigidity of a class of codes
- scientific article; zbMATH DE number 1284417
- The linear programming bound for binary linear codes
- On the maximality of linear codes
- A Bound for the Maximum Weight of a Linear Code
- On the extendability of linear codes
- scientific article
- scientific article; zbMATH DE number 3543912
- Further results on the semilinear equivalence of linear codes
- Linear programming bounds for codes via a covering argument
Cites Work
- Algebraically punctured cyclic codes
- Title not available (Why is that?)
- A note on the construction of optimal linear codes
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
- Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (21)
- 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
- Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes
- On generalized MacDonald codes
- Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes
- A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound
- The nonexistence of \([71,5,46;3]\)-codes
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- Classification of Griesmer codes and dual transform
- 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\)
- Linearly representable codes over chain rings
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- A 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 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
- 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 bound
- On linear rigidity of a class of codes
- A characterization of some minihypers in a finite projective geometry PG(t,4)
- A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs
- 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 \(\{ 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 codes
This page was built for publication: On linear codes which attain the Solomon-Stiffler bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798293)
