Antiblocking systems and PD-sets |
| |
Authors: | Hans-Joachim Kroll Rita Vincenti |
| |
Affiliation: | 1. Zentrum Mathematik, TUM, 80290 München, Germany;2. Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, Via Vanvitelli 1, 06123 Perugia, Italy;1. Italy;2. USA;3. Italy;4. Canada |
| |
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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|