Some geometric constructions of optimal quaternary codes

A linear [n,k,d] code over GF(4) is said to be optimal if the minimum distance d is as large as possible for given length n and dimension k. We show that some previously discovered optimal codes have natural geometric constructions. Particular reference is made to optimal [24,5,16] and [46,5,32] codes over GP(4).