3 citations · 3 across the 8 of their papers we have counts for
7 papers · 1 filter
An Explication of Optimal Equidistant Codes
Douglas R. Stinson
We discuss the problem of characterizing equidistant binary codes of a given length having largest possible distance and the maximum number of codewords. Such characterizations…
An introduction to local differential privacy protocols using block designs
Maura B. Paterson, Douglas R. Stinson
The design of protocols for local differential privacy (or LDP) has been a topic of considerable research interest in recent years. LDP protocols utilise the randomised encoding of…
Daniel Litt's Probability Puzzle
Maura B. Paterson, Douglas R. Stinson
In this expository note, we discuss a ``balls-and-urns'' probability puzzle posed by Daniel Litt.
Strong External Difference Families and Classification of -valuations
Donald L. Kreher, Maura B. Paterson, Douglas R. Stinson
One method of constructing -SEDFs (i.e., strong external difference families) in makes use of -valuations of complete bipartite graphs $K_{…
Weak and Strong Nestings of BIBDs
Douglas R. Stinson
We study two types of nestings of balanced incomplete block designs (BIBDs). In both types of nesting, we wish to add a point (the nested point) to every block of a -BIBD…
Nestings of BIBDs with block size four
Marco Buratti, Donald L. Kreher, Douglas R. Stinson
In a nesting of a balanced incomplete block design (or BIBD), we wish to add a point (the \emph{nested point}) to every block of a -BIBD in such a way that we end up with…
Block-avoiding sequencings of points in Steiner triple systems
Donald L. Kreher, Douglas R. Stinson
Given an STS(v), we ask if there is a permutation of the points of the design such that no consecutive points in this permutation contain a block of the design. Results are…