Let n/sub 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/sub 5/(4,d) for all but 22 values of d.

Let d/sub 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/sub 4/ (33,5)=22, d/sub 4/(49,5)=34, d/sub 4/(131,5)=96, d/sub 4/(142,5)=104, d/sub 4/(147,5)=108, d/sub 4/(152,5)=112, d/sub 4/(158,5)=116, d/sub 4/(176,5)/spl ges/129, d/sub 4/(180,5)/spl ges/132, d/sub 4/(190,5)/spl ges/140, d/sub 4/(195,5)=144, d/sub 4/(200,5)=148, d/sub 4/(205,5)=152, d/sub 4/(216,5)=160, d/sub 4/(227,5)=168, d/sub 4/(232,5)=172, d/sub 4/(237,5)=176, d/sub 4/(240,5)=178, d/sub 4/(242,5)=180, and d/sub 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/sub 4/(n,5) is presented.

Let an (n, k, d)-code denote a binary linear code of length n, dimension k, and minimum distance at least d. Define d(n, k) as the maximum value of d for which there exists a binary linear (n, k, d)-code. T. Verhoeff (1989) has provided an updated table of bounds on d(n, k) for 1>