The following pages link to D. R. Stinson (Q218816):
Displaying 50 items.
- Concerning the spectrum of perpendicular arrays of triple systems (Q1086568) (← links)
- On the existence of MOLS with equal-sized holes (Q1093643) (← links)
- Frames for Kirkman triple systems (Q1106226) (← links)
- Some constructions and bounds for authentication codes (Q1109006) (← links)
- Edge-coloured designs with block size four (Q1111556) (← links)
- A construction for authentication/secrecy codes from certain combinatorial designs (Q1112007) (← links)
- Pairwise balanced designs with block sizes \(6t+1\) (Q1112034) (← links)
- A perfect one-factorization for \(K_{36}\) (Q1112842) (← links)
- A skew Room square of order 129 (Q1142219) (← links)
- Some new row-complete latin squares (Q1145153) (← links)
- A general construction for group-divisible designs (Q1153918) (← links)
- The existence of Howell designs of odd side (Q1158155) (← links)
- The spectrum of room cubes (Q1165853) (← links)
- The existence of Howell designs of side n+1 and order 2n (Q1167173) (← links)
- Spanning sets and scattering sets in Steiner triple systems (Q1176376) (← links)
- A survey of Kirkman triple systems and related designs (Q1182956) (← links)
- Designs constructed from maximal arcs (Q1184006) (← links)
- Nesting directed cycle systems of even length (Q1193557) (← links)
- A parallelization of Miller's \(n^{\log n}\) isomorphism technique (Q1198063) (← links)
- Combinatorial characterizations of authentication codes (Q1200311) (← links)
- Some improved bounds on the information rate of perfect secret sharing schemes (Q1202917) (← links)
- An explication of secret sharing schemes (Q1203951) (← links)
- Towards the spectrum of Room squares with subsquares (Q1207773) (← links)
- Further results on large sets of disjoint group-divisible designs (Q1208347) (← links)
- (Q1265232) (redirect page) (← links)
- Some new results on key distribution patterns and broadcast encryption (Q1265233) (← links)
- Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution (Q1276261) (← links)
- Combinatorial techniques for universal hashing (Q1329163) (← links)
- Universal hashing and authentication codes (Q1335421) (← links)
- On the sprectra of certain classes of Room frames (Q1346726) (← links)
- A simple analysis of the error probability of two-point based sampling (Q1350935) (← links)
- On the dealer's randomness required in secret sharing schemes (Q1358664) (← links)
- Small group-divisible designs with block size four (Q1361665) (← links)
- Anonymous secret sharing schemes (Q1364776) (← links)
- On some methods for unconditionally secure key distribution and broadcast encryption (Q1369720) (← links)
- More thwarts in transversal designs (Q1383504) (← links)
- On the maximum number of fixed points in automorphisms of prime order of 2-\((v,k,\text 1)\) designs (Q1387612) (← links)
- New combinatorial designs and their applications to authentication codes and secret sharing schemes. (Q1428540) (← links)
- Generalized cover-free families. (Q1428544) (← links)
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (Q1569877) (← links)
- Extended capabilities for visual cryptography (Q1589430) (← links)
- Constructions and bounds for unconditionally secure non-interactive commitment schemes (Q1611358) (← links)
- Ideal ramp schemes and related combinatorial objects (Q1685978) (← links)
- Combinatorial repairability for threshold schemes (Q1692160) (← links)
- Multi-prover proof of retrievability (Q1755952) (← links)
- Sequentially perfect and uniform one-factorizations of the complete graph (Q1773191) (← links)
- Three characterizations of non-binary correlation-immune and resilient functions (Q1804979) (← links)
- On the contrast in visual cryptography schemes (Q1819123) (← links)
- The existence of simple \(S_ 3(3,4,\nu)\) (Q1823248) (← links)
- The Oberwolfach problem and factors of uniform odd length cycles (Q1825209) (← links)
