Cover-free families and topology-transparent scheduling for MANETs
From MaRDI portal
Publication:1877340
DOI10.1023/B:DESI.0000029213.74879.E0zbMath1053.94024MaRDI QIDQ1877340
Violet R. Syrotiuk, Charles J. Colbourn, Alan C. H. Ling
Publication date: 16 August 2004
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Steiner systemorthogonal arraymobile ad hoc networkdisjunct matrixcover-free familytopology-transparency
Orthogonal arrays, Latin squares, Room squares (05B15) Triple systems (05B07) Applications of graph theory to circuits and networks (94C15) Communication theory (94A05)
Related Items (4)
The design of (almost) disjunct matrices by evolutionary algorithms ⋮ Bounds and algorithms for generalized superimposed codes ⋮ Transport schemes for topology-transparent scheduling ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications
This page was built for publication: Cover-free families and topology-transparent scheduling for MANETs
