Partial permutation decoding for abelian codes

We show some sufficient conditions for a semisimple abelian code to be permutation decodable. We find non trivial partial PD-sets with respect to the information set introduced red by the authors in a previous paper. By using these results we present examples of permutation decodable abelian codes improving the bounds about the dimension given by S. G. S. Shiva, K. C. Fung and H. S. Y. Tan.