D. M. Gordon

activity

20032020

most citedOptimal hash functions for approximate closest pairs on the n-cube

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2025

Cyclic relative difference sets and circulant weighing matrices

Daniel M. Gordon

An $(m, n, k, λ)$ -relative difference set is a lifting of a $(m, k, nλ)$ -difference set. Lam gave a table of cyclic relative difference sets with $k \leq 50$ in 1977, all of which were…

math.CO2020

On difference sets with small $λ$

Daniel M. Gordon

In a 1989 paper \cite{arasu2}, Arasu used an observation about multipliers to show that no $(352, 27, 2)$ difference set exists in any abelian group. The proof is quite short and req…

math.CO2003

On the existence of cyclic difference sets with small parameters

Leonard D. Baumert, Daniel M. Gordon

Previous surveys by Baumert and Lopez and Sanchez have resolved the existence of cyclic (v,k,lambda) difference sets with k <= 150, except for six open cases. In this paper we show…

Cyclic relative difference sets and circulant weighing matrices

On difference sets with small λ

On the existence of cyclic difference sets with small parameters

On difference sets with small $λ$