Constructions for retransmission permutation arrays
Dinitz, J.H. and Paterson, Maura B. and Stinson, D.R. and Wei, R. (2012) Constructions for retransmission permutation arrays. Designs, Codes and Cryptography 65 (3), pp. 325-351. ISSN 0925-1022.
remap.pdf - Submitted Version
Restricted to Repository staff only
Li et al. (Retransmission ≠ repeat: simple retransmission permutation can resolve overlapping channel collisions, 2009) introduced a technique for resolving overlapping channel transmissions that used an interesting new type of combinatorial structure. In connection with this problem, they provided an example of a 4 × 4 array having certain desirable properties. We define a class of combinatorial structures, which we term retrans mission permutation arrays, that generalise the example that Li et al. provided. We show that these arrays exist for all possible orders. We also define some extensions having additional properties, for which we provide some partial results.
|School:||Birkbeck Schools and Departments > School of Business, Economics & Informatics > Economics, Mathematics and Statistics|
|Depositing User:||Maura Paterson|
|Date Deposited:||29 Nov 2012 11:39|
|Last Modified:||17 Apr 2013 12:33|
Additional statistics are available via IRStats2.