A characterization of \v_ +1+,v_;t,q\-min hypers and its applications to error-correcting codes and factorial designs
From MaRDI portal
Publication:1124584
Cites work
- scientific article; zbMATH DE number 3166657 (Why is no real title available?)
- scientific article; zbMATH DE number 4083640 (Why is no real title available?)
- scientific article; zbMATH DE number 3765799 (Why is no real title available?)
- scientific article; zbMATH DE number 3499621 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3421490 (Why is no real title available?)
- scientific article; zbMATH DE number 3057679 (Why is no real title available?)
- A Bound for Error-Correcting Codes
- A characterization of codes meeting the Griesmer bound
- A note on the Griesmer bound (Corresp.)
- A note on the construction of optimal linear codes
- Algebraically punctured cyclic codes
- 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 \(\{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
- Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming
- Construction of optimal linear codes using flats and spreads in a finite projective geometry
- On a Bound Useful in the Theory of Factorial Designs and Error Correcting Codes
- On a geometrical method of construction of maximal t-linearly independent sets
- On linear codes which attain the Solomon-Stiffler bound
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
Cited in
(11)- 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
- 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 \(\{ 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
- Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes
- 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 characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers and its applications to error-correcting codes
- Arcs, blocking sets, and minihypers
- A characterization of some minihypers in a finite projective geometry PG(t,4)
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- 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 \(\{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
This page was built for publication: A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124584)
