We introduce m-near-resolvable block designs. We establish a correspondence between such block designs and a subclass of (optimal equidistant) q-ary constant-weight codes meeting the Johnson bound. We present constructions of m-near-resolvable block designs, in particular based on Steiner systems and super-simple t-designs.

中文翻译：

---

关于m-近可分辨块设计和q -ary等重代码

我们介绍了m个可分辨的块设计。我们在这样的块设计和满足约翰逊界的（最优等距）q元恒定权重代码的子类之间建立了对应关系。我们介绍了m个可分辨块设计的构造，尤其是基于Steiner系统和超简单t设计的构造。