Ternary equidistant codes of length 11≤n≤15

We consider the problem of finding bounds on the size of ternary equidistant codes. Optimal codes have been constructed by combinatorial and computer methods. The exact values on B 3 (n,d) for ternary equidistant codes of length 11≤n≤15 are presented.