Balanced Codes and Tactical Configurations

We consider the general properties of balanced codes with the structure of tactical configurations and prove that the upper bounds for the number of words, which follow from Jonson's estimates, are achieved only for such codes. We give the distribution of distances in complete balanced codes which are isomorphic with Steiner systems and quasi-complete codes which are close to them. We also construct a new family of quasi-complete balanced codes.