Maximum distance of anticodes

Bounds on the maximum distance of anticodes are investigated. A refined version of the Plotkin lower bound on the maximum distance is presented, enabling its application to higher rate anticodes. A simplified expression for the Griesmer bound on the anticode length is derived, involving only the maximum distance subjected to a minor constraint. The minimum distance of the dual subspace is shown to be upper bounded by the anticode maximum distance. At least in the binary case this upper bound is tight and an example is provided by maximum distance anticodes and Hamming codes, which are duals and optimal.