Space-filling properties of good lattice point sets
研究了好格点集的空间填充性质，证明线性水平排列不减小最小距离，并构造了若干最大最小距离设计。
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.