Partial Permutation Decoding for Abelian Codes

In our earlier work, we introduced a technique to construct an information set for every semisimple Abelian code over an arbitrary field, solely in terms of its defining set. In this paper, we apply the geometrical properties of those information sets to obtain sufficient conditions for a -error correcting Abelian code to have a b-PD-set for every b ≤ t. These conditions are simply given in terms of the structure of the defining set of the code.