On the nonexistence of some quaternary linear codes meeting the Griesmer bound
From MaRDI portal
Publication:1299055
DOI10.1016/S0378-3758(98)00039-1zbMath0929.94031MaRDI QIDQ1299055
Publication date: 2 February 2000
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of some minihypers in a finite projective geometry PG(t,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
- On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q\)-codes meeting the Griesmer bound]
- Optimal ternary linear codes
- On a geometrical method of construction of maximal t-linearly independent sets
- 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 \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
- On the nonexistence of quaternary \([51, 4, 37\) codes]
- A characterization of codes meeting the Griesmer bound
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
- On a Bound Useful in the Theory of Factorial Designs and Error Correcting Codes
This page was built for publication: On the nonexistence of some quaternary linear codes meeting the Griesmer bound
