Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming
From MaRDI portal
Cited in
(15)- Construction of optimal linear codes using flats and spreads in a finite projective geometry
- 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 note on the construction of optimal linear 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
- 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
- Uniqueness 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\)
- On critical exponents of Dowling matroids
- 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
- The packing problem for projective geometries over GF(3) with dimension greater than five
- On linear codes which attain the Solomon-Stiffler bound
This page was built for publication: Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3892180)
