The following pages link to D. R. Stinson (Q218816):
Displaying 18 items.
- Orthogonal arrays of strength three from regular 3-wise balanced designs (Q5957824) (← links)
- Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels (Q5959833) (← links)
- Some new results on skew frame starters in cyclic groups (Q6041573) (← links)
- Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes (Q6047434) (← links)
- Rectangular, range, and restricted AONTs: three generalizations of all-or-nothing transforms (Q6067843) (← links)
- Unconditionally Secure Non-malleable Secret Sharing and Circular External Difference Families (Q6436808) (← links)
- On min-base palindromic representations of powers of 2 (Q6517345) (← links)
- A method of constructing pairwise balanced designs containing parallel classes (Q6527763) (← links)
- Nestings of BIBDs with block size four (Q6529043) (← links)
- Circular external difference families, graceful labellings and cyclotomy (Q6570033) (← links)
- Constructions and bounds for codes with restricted overlaps (Q6576242) (← links)
- Orthogonal and strong frame starters: revisited (Q6613376) (← links)
- Bounds on data limits for all-to-all comparison from combinatorial designs (Q6618615) (← links)
- Weak and Strong Nestings of BIBDs (Q6729536) (← links)
- Strong External Difference Families and Classification of $\alpha$-valuations (Q6732486) (← links)
- Daniel Litt's Probability Puzzle (Q6744190) (← links)
- Near-factorizations of dihedral groups (Q6754837) (← links)
- Uniqueness and explicit computation of mates in near-factorizations (Q6754842) (← links)
