Let [n, k, d]q codes be linear codes of length n, dimension k, and minimum Hamming distance d over GF(q). In this paper, the existence of the following codes is proven: [42, 6, 30]8, [49, 6, 36]8, [78, 6, 60]8, [84, 6, 65]8, [91, 6, 71]8, [96, 6, 75]8, [102, 6, 80]8, [108, 6, 85]8, [114, 6, 90]8,and [48, 6, 35]9, [54, 6, 40]9, [60, 6, 45]9, [96, 6, 75]9, [102, 6, 81]9, [108, 6, 85]9, [114, 6, 90]9, [126, 6, 100]9, [132, 6, 105]9. The nonexistence of five codes over GF(9) is also proven. All of these results improve the respective upper and lower bounds in Brouwer’s table [2].