Douglas R. Stinson

activity

20242026

collaborators

8 papers

math.CO2026

An Explication of Optimal Equidistant Codes

Douglas R. Stinson

We discuss the problem of characterizing equidistant binary codes of a given length $n$ having largest possible distance and the maximum number of codewords. Such characterizations…

math.CO2026

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…

math.GR2025

$I^»$ -fold near-factorizations of groups

Donald L. Kreher, Shuxing Li, Douglas R. Stinson

We initiate the study of $I^»$ -fold near-factorizations of groups with $I^» > 1$ . While $I^»$ -fold near-factorizations of groups with $I^» = 1$ have been studied in numerous papers, this…

math.GR2025

Near-factorizations of dihedral groups

Donald L. Kreher, Maura B. Paterson, Douglas R. Stinson

We investigate near-factorizations of nonabelian groups, concentrating on dihedral groups. We show that some known constructions of near-factorizations in dihedral groups yield equ…

math.GR2024

Uniqueness and explicit computation of mates in near-factorizations

Donald L. Kreher, William J. Martin, Douglas R. Stinson

We show that a "mate'' $B$ of a set $A$ in a near-factorization $(A, B)$ of a finite group $G$ is unique. Further, we describe how to compute the mate $B$ very efficiently using an…

math.CO2024

Daniel Litt's Probability Puzzle