Optimum codes of dimension 3 and 4 over GF(4)
Mahesh Chandra Bhandari, M.S. Garg · IEEE Transactions on Information Theory · 1992
n/sub q/(k,d), the length of a q-ary optimum code for given k and d, for q=4 and k=3, 4 is discussed. The problem is completely solved for k=3, and the exact value of n/sub 4/(4,d) is determined for all but 52 values of d.>