We demonstrate that certain Johnson-type bounds are asymptotically exact fora variety of classes of codes, namely, constant-composition codes, nonbinaryconstant-weight codes and multiply constant-weight codes. This was achieved viaan interesting application of the theory of decomposition of edge-coloreddigraphs.
展开▼