Characterization of \2(q+1) + 2, 2; t, q\-minihypers in PG(t,q) (t 3, q \3,4\)
DOI10.1016/0012-365X(93)90487-EzbMATH Open0776.51011OpenAlexW2019432609MaRDI QIDQ1801697FDOQ1801697
Øyvind Ytrehus, Noboru Hamada, Tor Helleseth
Publication date: 20 June 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90487-e
Recommendations
- 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 characterization of some minihypers in a finite projective geometry PG(t,4)
- Minihypers and linear codes meeting the Griesmer bound: Improvements to results of Hamada, Helleseth and Maekawa
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- scientific article; zbMATH DE number 691471
- Construction of some optimal ternary linear codes and the uniqueness of \([294, 6, 195; 3]\)-codes meeting the Griesmer bound
- A characterization of some minihypers and its application to linear 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
- scientific article; zbMATH DE number 933182
- scientific article; zbMATH DE number 874272
Combinatorial structures in finite projective spaces (51E20) Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22)
Cites Work
- A Bound for Error-Correcting 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
Cited In (9)
- Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes
- A study of \((x(q + 1), x; 2, q)\)-minihypers
- Title not available (Why is that?)
- 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\)
- Minihypers and linear codes meeting the Griesmer bound: Improvements to results of Hamada, Helleseth and Maekawa
- A characterization of some minihypers in a finite projective geometry PG(t,4)
- On the nonexistence of some quaternary linear codes meeting the Griesmer bound
This page was built for publication: Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801697)