A New Construction of Permutation Arrays
Let PA(n, d) be a permutation array (PA) of order n and the minimum distance d. We propose a new construction of the permutation array PA (pm, p(m-1) k) for a given prime number p, a positive integer k  = 2p/3. Moreover the proposed construction provides an algorithm to find the i-th row of PA (p(m), p(m-1) k) for a given index i very simply.
permutation array error correcting code