Abstract:
A general method is described for constructing equidistant codes with maximum distance; the method exhausts all cases in which the basis and the number of words in the code are arbitrary powers of a prime number. The relation between these codes and maximum balanced binary codes is considered.
Fulltext:
PDF file (314 kB)