Nonexistence of linear codes meeting the Griesmer bound
From MaRDI portal
Publication:2075499
DOI10.1016/j.disc.2021.112744zbMath1495.94116OpenAlexW4200034605MaRDI QIDQ2075499
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112744
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the geometric constructions of optimal linear codes
- On the minimum length of linear codes over the field of 9 elements
- On optimal linear codes over \(\mathbb F_8\)
- Nonexistence of some Griesmer codes over \(\mathbb{F}_q\)
- On optimal linear codes over \(\mathbb F_5\)
- 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 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 minimum length of some linear codes
- On optimal non-projective ternary linear codes
- 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\).]
- On the nonexistence of \(q\)-ary linear codes of dimension five
This page was built for publication: Nonexistence of linear codes meeting the Griesmer bound
