An extended construction of permutation arrays with a polynomial-time sampling algorithm

Let PA(n, d) be a permutation array (PA) of order n and minimum distance d. Recently Park et. al proposed a construction of PA (p², pk) when p is a prime number and k is a positive integer less than p. In this paper, we present two extensions of their work to construct PA (p^m, p^m-1 k) for any m ≥ 2.