Summary: We examine codes from the Paley graphs for the purpose of permutation decoding and observe that, after a certain length, PD-sets to correct errors up to the code’s error capability will not exist. In this paper we construct small sets of permutations for correcting two errors by permutation decoding for the case where the codes have prime length.