𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some constructions and bounds for authentication codes

✍ Scribed by D. R. Stinson

Publisher
Springer
Year
1988
Tongue
English
Weight
660 KB
Volume
1
Category
Article
ISSN
0933-2790

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Information-theoretic bounds for authent
Information-theoretic bounds for authentication codes and block designs
✍ Dingyi Pei πŸ“‚ Article πŸ“… 1995 πŸ› Springer 🌐 English βš– 480 KB

Authentication codes with secrecy and with splitting are investigated. An information-theoretic lower bound for the probability of successful deception for a spoofing attack of order r is obtained. The condition necessary on authentication codes to achieve the lower bound is determined as a single s

Some combinatorial constructions for opt
Some combinatorial constructions for optical orthogonal codes
✍ Jianxing Yin πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 942 KB

A (v,k,p) optical orthogonal code ~ is a family of (0,1)-sequences of length v and weight k satisfying the following two properties: (1)~o<.,<.v\_lXtX,+i<~p, for any x = (Xo, x ~ ..... x ~\_ ~ ) e ~ and any integer i ~ 0 (rood v); (2) 5~ o ~, .< ~-~ x~ y, + ~ ~< p, for any x ~ y in ~ and any integer

Some lower bounds for constant weight co
Some lower bounds for constant weight codes
✍ Iiro Honkala; Heikki HΓ€mΓ€lΓ€inen; Markku Kaikkonen πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 178 KB