Surveys in Combinatorics, 1999 1999
DOI: 10.1017/cbo9780511721335.004
|View full text |Cite
|
Sign up to set email alerts
|

Applications of Combinatorial Designs to Communications, Cryptography, and Networking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
88
0

Year Published

2000
2000
2010
2010

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 105 publications
(88 citation statements)
references
References 0 publications
0
88
0
Order By: Relevance
“…We say two such partitions P and Q are qualitatively independent if each cell of P and each cell of Q have at least one element in common. For practical reasons, we want large sets of pairwise qualitatively independent partitions [3,7,14,15].…”
Section: Set-partitionsmentioning
confidence: 99%
“…We say two such partitions P and Q are qualitatively independent if each cell of P and each cell of Q have at least one element in common. For practical reasons, we want large sets of pairwise qualitatively independent partitions [3,7,14,15].…”
Section: Set-partitionsmentioning
confidence: 99%
“…When the finite abstract set is composed of subsets each of fixed size k, these subsets are known as blocks. Traditional instances of CDPs that involve blocks are often found in combinatorial and design theory [12], but real world problems such as tournament and conference scheduling [10], and cryptography [13], also frequently exhibit this structure. Their significance is felt acutely in real world applications such as optical network design and routing (WDM, DWDM, SONET).…”
Section: Challenging Problemsmentioning
confidence: 99%
“…see [13] for a survey). They deal essentially with the search for families of sets with certain properties subject to constraints including intersection and cardinality restrictions.…”
Section: Introductionmentioning
confidence: 99%
“…Several researchers have studied combinatorial group testing and its applications to cryptography and information encoding (e.g., see [16,26]). This area is directed at performing group tests on subsets of a given set S to identify defective elements in S. The area has not to date been applied to data index integrity, but in this paper we show an interesting connection between data forensics marking and a new reduced-randomness construction of a nonadaptive combinatorial group testing scheme, which may be of independent interest.…”
Section: Introductionmentioning
confidence: 99%