Constructions for retransmission permutation arrays

  • Authors:

  • Jeffrey H. Dinitz;Maura B. Paterson;Douglas R. Stinson;Ruizhong Wei

  • Affiliations:

  • Department of Mathematics and Statistics, University of Vermont, Burlington, USA 05405;Department of Economics, Mathematics and Statistics, Birkbeck University of London, London, UK WC1E 7HX;David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada N2L 3G1;Department of Computer Science, Lakehead University, Thunder Bay, Canada P7B 5E1

  • Venue:
  • Designs, Codes and Cryptography
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.