Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four (Q663476): Difference between revisions

H-designs, introduced by \textit{H. Hanani} [``On same tactical configurations,'' Can. J. Math 15, 702--722 (1963; Zbl 0196.29102)], generalize group divisible designs. The covering version of H-designs is here considered. Specifically, the problem of minimizing the size of group divisible coverings of triples by quadruples is studied. All cases with at least \(n=4\) groups and group size \(g=3\) or \(g=2^m\), \(m \geq 1\), are settled, except for the case of \(n=5\) and \(g=2\). This problem can also be considered in the framework of codes with length \(n\) and constant weight 4 over an alphabet of size \(g+1\). Certain nonuniform group divisible 3-designs are also obtained. Reviewer's remark: The exception could be settled by exhaustive computer search.