The problem of finding the values of A(q)(n,d)-the maximum size of a code o
f length n and minimum distance d over an alphabet of q elements-is conside
red. Upper and lower bounds on A(4)(n,d) are presented and some values of t
his function are settled. A table of best known bounds on A(4)(n,d) is give
n for n less than or equal to 12. When q less than or equal to M < 2q, all
parameters for which A(q)(n,d) = M are determined.