A problem of combinatorial designs related to authentication codes
β Scribed by Dingyi Pei
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 433 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
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 balanced t-designs are constructed by means of rational normal curves over finite fields. Thus based on this new partially balanced t-designs a new class of authentication codes is obtained.
π SIMILAR VOLUMES
Suppose we have a tournament with edges labelled so that the edges incident with any vertex have at most k distinct labels (and no vertex has outdegree 0). Let m be the minimal size of a subset of labels such that for any vertex there exists an outgoing edge labelled by one of the labels in the subs
The constrained 2D cutting stock problem is an irregular problem with dynamic data structures, highly variable amounts of computation per task, and unpredictable amounts and patterns of communication. This paper describes the design and implementation of a parallel solution to this problem on a clus
We have cloned and sequenced a Candida albicans gene (SSB1) encoding a potential member of the heat-shock protein seventy (hsp70) family. The protein encoded by this gene contains 613 amino acids and shows a high degree (85%) of sequence identity to the ssb subfamily (ssb1 and ssb2) of the Saccharom