Maximal ternary codes and Plotkin's bound

The analogue of Plotkin's bound is developed for ternary codes with high distance relative to length. Generalized Hadamard matrices are used to obtain codes which meet these bounds. The ternary analogue of Levenshtein's construction is discussed and maximal codes constructed.