New bounds for the minimum length of quaternary linear codes of dimension five

Let n(4)(k,d) be the smallest integer n, such that a quaternary linear [n, k,d]-code exists. The bounds n(4)(5, 21)less than or equal to 32, n(4)(5, 30) = 43, n(4)(5, 32) = 46, n(4)(5, 36) = 51, n(4)(5, 40)less than or equal to 57, n(4)(5, 48)less than or equal to 67, n(4)(5, 64) = 88, n(4)(5, 68)less than or equal to 94, n(4)(5, 70)less than or equal to 97, n(4)(5, 92)less than or equal to 126, n(4)(5, 98)less than or equal to 135, n(4)(5, 122) = 165, n(4)(5, 132)less than or equal to 179, n(4)(5, 136)less than or equal to 184, n(4)(5, 140)=189, n(4)(5, 156)less than or equal to 211, n(4)(5, 162)= 219, n(4)(5, 164) less than or equal to 222, n(4)(5, 166)less than or equal to 225, n(4)(5, 173)less than or equal to 234, n(4)(5, 194) = 261, n(4)(5, 204) = 273, n(4)(5,208) = 279, n(4)(5,212) = 284, n(4)(5, 214) = 287,n(4)(5,216) = 290 and n(4)(5,220) = 295 are proved. A [q(4) + q(2) + 1, 5, q(4) - q(3) + q(2) - q]-code over GF(q) exists for every q.