On optimal codes over the field with five elements
From MaRDI portal
Let \(n_q(k,d)\) denote the minimal length of a linear code of dimension \(k\) and minimum distance \(d\) over the field \(\text{GF}(q)\). An important problem in coding theory is to find the exact value of \(n_q(k,d)\), for given \(k\), \(d\) and \(q\). It is known that a full length linear code is equivalent to an arc in a finite projective space. The authors use this equivalence to prove the nonexistence of Griesmer codes over \(\text{GF}(5)\) for \(k=4\) and \(d=33,83,163,164\).
Recommendations
Cited in
(8)- On optimal linear codes over \(\mathbb F_5\)
- Some new results on optimal codes over \(\mathbb F_5\)
- New minimum distance bounds for linear codes over GF(5).
- A new extension theorem for linear codes
- On multiple caps in finite projective spaces
- The nonexistence of a \([207,4,165]\) code over \(GF(5)\)
- On the minimum length of linear codes of dimension 5
- New sufficient conditions for the extendability of quaternary linear codes
This page was built for publication: On optimal codes over the field with five elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404325)