On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q]\)-codes meeting the Griesmer bound
From MaRDI portal
Publication:1200291
DOI10.1007/BF00141966zbMath0756.94007OpenAlexW1980272394MaRDI QIDQ1200291
Noboru Hamada, Øyvind Ytrehus, Tor Helleseth
Publication date: 16 January 1993
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00141966
Related Items (8)
An optimal ternary [69,5,45 code and related codes] ⋮ New bounds for the minimum length of quaternary linear codes of dimension five ⋮ 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\)] ⋮ A characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers 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] ⋮ On the nonexistence of some quaternary linear codes meeting the Griesmer bound ⋮ The nonexistence of ternary [79, 6, 51 codes]
Cites Work
- 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
- Caps and codes
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q]\)-codes meeting the Griesmer bound
