Optimal almost equisymbol codes based on difference matrices

A method for constructing optimal almost equisymbol codes based on difference matrices is proposed. Some of these codes generate previously unknown optimal equidistant codes satisfying the Plotkin bound. As a consequence, they generate new resolvable balanced incomplete block designs.