A characterization of some minihypers in a finite projective geometry PG(t,4)

DOI10.1016/S0195-6698(13)80039-XzbMATH Open0728.51011OpenAlexW2055819535MaRDI QIDQ804949FDOQ804949

Authors: Noboru Hamada, Tor Helleseth 

Publication date: 1990

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(13)80039-x

Recommendations

• A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
• Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\)
• 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
• Minihypers and linear codes meeting the Griesmer bound: Improvements to results of Hamada, Helleseth and Maekawa
• 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
• scientific article; zbMATH DE number 4083640
• A classification result on weighted {δ (p³ + 1), δ; 3, p³}‐minihypers
• scientific article; zbMATH DE number 874272

zbMATH Keywords

codesfinite geometryminihyper

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22)

Cites Work

• Title not available (Why is that?)
• Algebraically punctured cyclic codes
• A Bound for Error-Correcting Codes
• On a geometrical method of construction of maximal t-linearly independent sets
• 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
• A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
• A characterization of codes meeting the Griesmer bound
• A note on the construction of optimal linear codes
• On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
• On linear codes which attain the Solomon-Stiffler bound
• Construction of optimal linear codes using flats and spreads in a finite projective geometry
• Arcs and blocking sets. II
• 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 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
• Title not available (Why is that?)

Cited In (11)

• Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\)
• 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 some minihypers in \(\mathrm{PG}(4,3)\)
• Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes
• A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
• 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
• 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
• On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q]\)-codes meeting the Griesmer bound
• On the nonexistence of some quaternary linear codes meeting the Griesmer bound

This page was built for publication: A characterization of some minihypers in a finite projective geometry PG(t,4)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804949)