New bounds for n4(k,d) and classification of some optimal codes over GF(4) Original Research Article

Let n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k and d. For codes of dimension five, we compute the exact values of n4(5,d) for 75 previously open cases. Additionally, we show that n4(6,14)=24, n4(7,9)=18, and n4(7,10)=20. Moreover, we classify optimal quaternary codes for some values of n and k.