The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, . . . , t -1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially
Combinatorial designs - a tribute to Haim Hanani
โ Scribed by Alan Hartman
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 209 KB
- Volume
- 77
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The k-MAXCUT problem for undirected graphs C = (V, E ) consists of finding a partition V = V , U . . . U V, such that the number of edges with endpoints in two different sets V, is maximized. We offer a new approach to this problem by showing that the combinatorial notion of block designs can be use
## Abstract Chronic spinal cord injury (SCI) is associated with the development of serious medical concerns. In fact, it is increasingly well documented that most SCI patients who survive the first 24 hr will rapidly develop, within a few months to a few years, cardiovascular problems, type II diab