Optimal linear codes of dimension 4 over F-5
Let n(q) (k, d) be the smallest integer n for which there exists a linear code of length n, dimension k, and minimum distance d, over a field of q elements. In this correspondence we determine n(5) (4, d) for all but 22 values of d.
optimal q-ary linear codes minimum-length bounds