UCLA

Maximin distance Latin hypercube designs are becoming increasingly prevalent in computer experiments. As addressed by Wang,Xiao and Xu (2018), $p \times (p-1)$ optimal designs, \ or asymptotically optimal designs based on good lattice point sets have been successfully constructed using Williams transformation; in this paper, we would like to further this idea for more general, or more flexible, designs, such as $N \times \frac{(N-1)}{2}$ for N equal to primes, prime multiples and prime powers, and implement a similar construction algorithm to build optimal or asymptotically optimal designs of such dimension.