A geometric approach to classifying Griesmer codes
From MaRDI portal
Publication:2384039
DOI10.1007/s10623-007-9086-1zbMath1143.94028OpenAlexW2018282671MaRDI QIDQ2384039
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-9086-1
Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)
Related Items (5)
A study of \((x(q + 1), x; 2, q)\)-minihypers ⋮ Nonexistence of some Griesmer codes over \(\mathbb{F}_q\) ⋮ A study of \((xv_t, xv_{t-1})\)-minihypers in \(\mathrm{PG}(t,q)\) ⋮ The maximal size of 6- and 7-arcs in projective Hjelmslev planes over chain rings of order 9 ⋮ On the minimum length of linear codes over the field of 9 elements
Cites Work
- Classification of some optimal ternary linear codes of small length
- A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry
- Divisibility of codes meeting the Griesmer bound
- The packing problem in statistics, coding theory and finite projective spaces
- Maximal arcs in Desarguesian planes of odd order do not exist
- An extension theorem for linear codes
- Optimal four-dimensional codes over \(\text{GF}(8)\)
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
- The nonexistence of a \([207,4,165\) code over \(GF(5)\)]
- On \(q^2+q+2, q+2\)-arcs in the projective plane \(PG(2,q)\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A geometric approach to classifying Griesmer codes
