Slepians permutation codes are investigated in detail. In particular we optimize the initial vector and derive all dominating codes in dimension n 2 6. With the exception of the simplex and biorthogonal codes - which are always included as special cases of permutation codes - there are probably no further good codes in higher dimensions.