A problem of combinatorial designs relat
โ
Dingyi Pei
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 433 KB
๐ 2 views
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