On the minimum length of q-ary linear codes of dimension five
From MaRDI portal
Publication:1360280
A fundamental problem in coding theory is to determine \(n_q (k,d)\), the minimum value of \(n\) for which there exists an \([n,k,d]_q\) code over \(GF(q)\) for given \(q,k\) and \(d\). A lower bound on \(n_q(k,d)\) has been provided by the well known Griesmer bound. The purpose of this paper is to determine \(n_q(5,d)\) for \[ q^4-q^3-q -\sqrt q-2<d\leq q^4-q^4+ q^2-q \text{ for all }q. \] The technique employed in determining \(n_q(5,d)\) is a geometric method.
Recommendations
Cited in
(12)- On optimal linear codes over \(\mathbb F_5\)
- On the minimum length of quaternary linear codes of dimension five
- On the minimum length of some linear codes
- On the minimum length of linear codes over \(\mathbb{F}_5\)
- On the minimum length of some linear codes of dimension 5
- The classification and determination on weight hierarchies of q-ary linear codes of dimension 5
- A class of the hamming weight hierarchy of linear codes with dimension 5
- scientific article; zbMATH DE number 5524392 (Why is no real title available?)
- On the upper bound of the minimum length of 5-dimensional linear codes
- scientific article; zbMATH DE number 5592915 (Why is no real title available?)
- On the nonexistence of q-ary linear codes of dimension five
- On the minimum length of linear codes of dimension 5
This page was built for publication: On the minimum length of \(q\)-ary linear codes of dimension five
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360280)