NEW TERNARY AND QUATERNARY CONSTANT-WEIGHT EQUIDISTANT CODES
Galina T. Bogdanova, Тодор Тодоров, Teodora Yorgova · Discrete Mathematics Algorithms and Applications · 2010
In this paper we consider the problem of finding bounds on the size of ternary and quaternary constant-weight equidistant codes with 2 ≤ w < n ≤ 10. Optimal ternary and quaternary constant-weight equidistant codes have been constructed by combinatorial and computer methods. All open cases for the size of optimal ternary and quaternary constant-weight equidistant codes have been closed.