Abstract:
The problem of constructing equidistant codes over an alphabet of an arbitrary
size $q$ is considered. Some combinatorial constructions and computer-based search methods are
presented. All maximal equidistant codes with distances 3 and 4 are found.