33 citations · 78 across the 45 of their papers we have counts for
5 papers · 1 filter
Constructions of optimal orthogonal arrays with repeated rows
Charles J. Colbourn, Douglas R. Stinson, Shannon Veitch
We construct orthogonal arrays OA (of strength two) having a row that is repeated times, where is as large as possible. In particular, we consider OAs where the r…
Bounds for orthogonal arrays with repeated rows
Douglas R. Stinson
In this expository paper, we mainly study orthogonal arrays (OAs) of strength two having a row that is repeated times. It turns out that the Plackett-Burman bound (\cite{PB}) c…
A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes
Bailey Kacsmar, Douglas R. Stinson
A repairable threshold scheme (which we abbreviate to RTS) is a -threshold scheme in which a subset of players can "repair" another player's share in the event that their sh…
A Brief Retrospective Look at the Cayley-Purser Public-key Cryptosystem, 19 Years Later
Douglas R. Stinson
The purpose of this paper is to describe and analyze the Cayley-Purser algorithm, which is a public-key cryptosystem proposed by Flannery in 1999. I will present two attacks on it,…
A polynomial ideal associated to any - design
William J. Martin, Douglas R. Stinson
We consider ordered pairs where is a finite set of size and is some collection of -element subsets of such that every -element sub…