On the minimum length of some linear codes
From MaRDI portal
Publication:2384020
DOI10.1007/s10623-007-9070-9zbMath1138.94019OpenAlexW2035267770MaRDI QIDQ2384020
Publication date: 20 September 2007
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9070-9
Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)
Related Items (7)
On the geometric constructions of optimal linear codes ⋮ Unnamed Item ⋮ Nonexistence of some Griesmer codes over \(\mathbb{F}_q\) ⋮ The non-existence of Griesmer codes with parameters close to codes of Belov type ⋮ A class of optimal linear codes of length one above the Griesmer bound ⋮ Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes ⋮ Nonexistence of linear codes meeting the Griesmer bound
Cites Work
- Extension theorems for linear codes over finite fields
- 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 \(q\)-ary linear codes of dimension four
- On a particular class of minihypers and its applications. I: The result for general \(q\)
- On the minimum length of some linear codes of dimension 5
- On the nonexistence of \(q\)-ary linear codes of dimension five
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the minimum length of some linear codes
