Constructions of uniform designs by using resolvable packings and coverings

AbstractUniform designs have been widely used in computer experiments, as well as in industrial experiments when the underlying model is unknown. Based on the discrete discrepancy, the link between uniform designs, and resolvable packings and coverings in combinatorial theory is developed. Through resolvable packings and coverings without identical parallel classes, many infinite classes of new uniform designs are then produced