The non-existence of Griesmer codes with parameters close to codes of Belov type
From MaRDI portal
Publication:717146
DOI10.1007/s10623-010-9443-3zbMath1238.94035MaRDI QIDQ717146
Publication date: 27 September 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9443-3
94B05: Linear codes (general theory)
94B65: Bounds on codes
05B25: Combinatorial aspects of finite geometries
51E20: Combinatorial structures in finite projective spaces
Related Items
Unnamed Item, On the geometric constructions of optimal linear codes, Nonexistence of some Griesmer codes over \(\mathbb{F}_q\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of some minihypers and its application to linear codes
- On the achievement of the Griesmer bound
- 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
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
- On the nonexistence of \(q\)-ary linear codes of dimension five