Optimal quaternary linear codes of dimension five

Let d(q)(n, k) be the maximum possible minimum Hamming distance of a q-ary [n, k, d]-code for given values of n and k. It is proved that d(4) (33,5) = 22, d(4)(49,5) = 34, d(4)(131,5) = 96, d(4)(142,5) = 104, d(4)(147,5) = 108, d(4)(152,5) = 112, d(4)(158,5) = 116, d(4)(176,5) greater than or equal to 129, d(4)(180,5) greater than or equal to 132, d(4)(190,5) greater than or equal to 140, d(4)(195,5) = 144, d(4)(200,5) = 148, d(4)(205,5) = 152, d(4)(216,5) = 160, d(4)(227,5) = 168, d(4)(232,5) = 172, d(4)(237,5) = 176, d(4)(240,5) = 178, d(4)(242,5) = 180, and d(4)(247,5) = 184. A survey of the results of recent work on bounds for quaternary Linear codes in dimensions four and five is made and a table with lower and upper bounds for d(4)(n,5) is presented.