摘要

We study space-filling properties of good lattice point sets and obtain some general theoretical results. We show that linear level permutation does not decrease the minimum distance for good lattice point sets, and we identify several classes of such sets with large minimum distance. Based on good lattice point sets, some maximin distance designs are also constructed.