… In [6] there are presented examples of PD-sets S for the codes related to … of an antiblocking
system (cf. Section 2). The properties of such an antiblocking system may help to find PD-sets …

… PD-sets. The question arises whether the Gordon bound is sharp. To handle this problem we
introduce the notion of antiblocking system … the notion of antiblocking system and we show …

… In 2002, we started to look for PD-sets for codes defined by some classical varieties in
finite projective spaces. The information sets of such codes correspond to the basis of the …

… An AI-system is a t -antiblocking system consisting of information sets A i . In this way we get
… -systems which are not derived from PD-sets and which are smaller than the known PD-sets. …

… Therefore it is of special interest to find small PD-sets and small AI-systems. In 2004 JD
Key, J. Moori, and BG Rodrigues [1] presented PD-sets for the binary codes Cn from triangular …

… In this paper we establish the existence of nested s-PD-sets … information systems introduced
by Kroll and Vincenti [11] is … codes, PD-sets and antiblocking information systems are given …

… An AI-system (Antiblocking system) is a new decoding algorithm developed by Kroll and …
-system of the same size. But there also may exist AI-systems that are not derived from PD-sets …

… (2) If Aut(C) contains PD–sets, then find a PD-set of smallest possible size. These problems
… This approach produced several examples of small PD–sets that, in some cases, can be …

… an antiblocking system. The properties of such an antiblocking system may help to find PD-sets
… Indeed, based on our results concerning antiblocking systems we will present examples …

… Thus if nested s -PD-sets are found for all \(1<s \le t\) then we can order S as follows: find
an s-PD-set \(S_s\) for each \(0 \le s \le t\) such that \( S_0 \subset S_1 \ldots \subset S_t\) and …