Diameter perfect codes form a natural generalization for perfect codes. They are based on the code-anticode bound which generalizes the sphere-packing bound. The code-anticode bound was proved by Delsarte for distance-regular graphs and it holds for some other metrics too. In this paper we prove the bound for non-binary constant-weight codes with the Hamming metric and characterize the diameter perfect codes and the maximum size anticodes for these codes. We distinguish between six families of non-binary diameter constant-weight codes and four families of maximum size non-binary constant-weight anticodes. Each one of these families of diameter perfect codes raises some different questions. We consider some of these questions and leave lot of ground for further research. Finally, as a consequence, some t-intersecting families related to the well-known Erd\"{o}s-Ko-Rado theorem, are constructed.

翻译：直径完全代码构成完美代码的自然概括性。 它们基于将球体包装捆绑起来的代码反代码约束。 代码反代码约束由 Delsart 证明为远程常规图形, 并保留了其它的量度。 在本文中, 我们证明非二进制常量代码与Hamming 测量值具有约束性, 并描述这些代码的直径完美代码和最大尺寸的反代码。 我们区分了6个非二进制常量代码家族和4个最大尺寸非二进制常量反代码家族。 每个直径完美代码家族都提出了不同问题。 我们考虑这些问题, 留下许多地方供进一步研究。 最后, 一些与著名的Erd\{ {o}- Ko- Rodo 参数有关的跨式家庭已经建成。