Nonexistence of \([n,5,d]_q\) codes attaining the Griesmer bound for \(q^4-2q^2-2q+1\leq d\leq q^4-2q^2-q\).
From MaRDI portal
Publication:2572969
DOI10.1007/s10623-004-1720-6zbMath1158.94422MaRDI QIDQ2572969
Seon Jeong Kim, Takao Kato, Eun Ju Cheon
Publication date: 7 November 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-004-1720-6
94B05: Linear codes (general theory)
94B65: Bounds on codes
05B25: Combinatorial aspects of finite geometries
51E20: Combinatorial structures in finite projective spaces
Related Items
Nonexistence of a[\(g_q(5,d),5,d_q\) code for \(3q^4-4q^3-2q+1\leqslant d\leqslant 3q^4-4q^3-q\)]
Cites Work
- Polynomial multiplicities over finite fields and intersection sets
- On the minimum length of quaternary linear codes of dimension five
- On the minimum size of some minihypers and related linear codes
- A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
- On the non-existence of linear codes attaining the Griesmer bound
- On the nonexistence of \(q\)-ary linear codes of dimension five