Optimal four-dimensional codes over GF(8)
From MaRDI portal
Publication:2500962
Summary: We prove the nonexistence of several four-dimensional codes over \(\text{GF}(8)\) that meet the Griesmer bound. The proofs use geometric methods based on the analysis of the weight structure of subcodes. The specific parameters of the codes ruled out are: \([111,4,96]\), \([110,4,95]\), \([102,4,88]\), \([101,4,87]\), \([93,4,80]\), and the sequence \([29-j,4,24-j]\), for \(j=0,1,2\).
Recommendations
Cited in
(8)- A geometric approach to classifying Griesmer codes
- On optimal linear codes of dimension 4
- scientific article; zbMATH DE number 3943703 (Why is no real title available?)
- Optimum codes of dimension 3 and 4 over GF(4)
- Extension theorems for linear codes over finite fields
- Geometric reed-solomon codes of length 64 and over 65 over F/sub 8/
- Nonexistence of some four dimensional linear codes attaining the Griesmer bound
- New sufficient conditions for the extendability of quaternary linear codes
This page was built for publication: Optimal four-dimensional codes over \(\text{GF}(8)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500962)