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.
![[img]](https://eprints.bbk.ac.uk/style/images/fileicons/text.png) |
Text
remap.pdf - First Submitted (AKA Pre-print) Restricted to Repository staff only Download (257kB) |
Abstract
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.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Maura Paterson |
| Date Deposited: | 29 Nov 2012 11:39 |
| Last Modified: | 09 Aug 2023 12:32 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/5364 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
