We present two new families of resolvable block designs. We introduce the notion of a weakly resolvable block design and prove the equivalence of such designs and nonbinary codes meeting… Click to show full abstract
We present two new families of resolvable block designs. We introduce the notion of a weakly resolvable block design and prove the equivalence of such designs and nonbinary codes meeting the Johnson bound. We construct a new family of such codes.
               
Click one of the above tabs to view related content.