No abstract

Since the permutation decoding algorithm is more efficient the smaller the size of the PD-set, it is important for the applications to find small PD-sets. A lower bound on the size of a PD-set is given by Gordon. There are examples for PD-sets, but up to now there is no method known to find PD-sets. The question arises whether the Gordon bound is sharp. To handle this problem we introduce the notion of antiblocking system and we show that there are examples where the Gordon bound is not sharp.

No abstract

No abstract

No abstract