The following pages link to D. R. Stinson (Q218816):
Displaying 50 items.
- Pairwise Balanced Designs with Block Sizes Three and Four (Q4009515) (← links)
- Steiner triple systems of order 19 with nontrivial automorphism group (Q4012400) (← links)
- (Q4014320) (← links)
- (Q4014422) (← links)
- Frames with Block Size Four (Q4015251) (← links)
- (Q4017168) (← links)
- (Q4017200) (← links)
- (Q4026143) (← links)
- (Q4026147) (← links)
- (Q4035707) (← links)
- (Q4035708) (← links)
- (Q4189287) (← links)
- (Q4190655) (← links)
- (Q4201562) (← links)
- Some recursive constructions for perfect hash families (Q4221879) (← links)
- (Q4234989) (← links)
- (Q4243057) (← links)
- (Q4250813) (← links)
- (Q4263658) (← links)
- A Generalized Rao Bound for Ordered Orthogonal Arrays and (<i>t, m, s</i>)-Nets (Q4267614) (← links)
- Association Schemes for Ordered Orthogonal Arrays and (<i>T, M, S</i>)-Nets (Q4267787) (← links)
- (Q4279577) (← links)
- (Q4279656) (← links)
- (Q4304341) (← links)
- Decomposition constructions for secret-sharing schemes (Q4307278) (← links)
- (Q4309121) (← links)
- (Q4318692) (← links)
- (Q4365725) (← links)
- (Q4379736) (← links)
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes (Q4388977) (← links)
- (Q4393245) (← links)
- On Unconditionally Secure Robust Distributed Key Distribution Centers (Q4412808) (← links)
- (Q4413869) (← links)
- (Q4418542) (← links)
- Combinatorial Designs (Q4441040) (← links)
- Contrast Optimal Threshold Visual Cryptography Schemes (Q4443082) (← links)
- New constructions for perfect hash families and related structures using combinatorial designs and codes (Q4487082) (← links)
- (Q4522102) (← links)
- Combinatorial properties of frameproof and traceability codes (Q4544540) (← links)
- Efficient metering schemes with pricing (Q4544727) (← links)
- (Q4552260) (← links)
- A Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks (Q4564103) (← links)
- Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets (Q4570879) (← links)
- A tight bound on the size of certain separating hash families (Q4595190) (← links)
- (Q4595643) (← links)
- On the maximum number of different ordered pairs of symbols in sets of latin squares (Q4651891) (← links)
- (Q4732492) (← links)
- (Q4736424) (← links)
- (Q4742790) (← links)
- (Q4742802) (← links)
