๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal authentication systems and combinatorial designs

โœ Scribed by Jimbo, M.; Fuji-Hara, R.

Book ID
114540388
Publisher
IEEE
Year
1990
Tongue
English
Weight
689 KB
Volume
36
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A problem of combinatorial designs relat
A problem of combinatorial designs related to authentication codes
โœ 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

Combinatorial constructions for optimal
Combinatorial constructions for optimal supersaturated designs
โœ Kai-Tai Fang; Gennian Ge; Min-Qian Liu; Hong Qin ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 241 KB

Combinatorial designs have long had substantial application in the statistical design of experiments, and in the theory of error-correcting codes. Applications in experimental and theoretical computer science, communications, cryptography and networking have also emerged in recent years. In this pap