On $m$-near-resolvable block designs and $q$-ary constant-weight codes

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.