We give two constructions for semi-regular relative difference sets (RDSs) in groups whose order is not a prime power, where the order u of the forbidden subgroup is greater than 2. No such RDSs were previously known. We use examples from the first construction to produce semi-regular RDSs in groups whose order can contain more than two distinct prime factors. For u greater than 2 these are the first such RDSs, and for u = 2 we obtain new examples
We modify and generalize the construction by McFarland (1973) in two different ways to construct new...
Jungnickel (1982) and Elliot and Butson (1966) have shown that (pj+1,p,pj+1,pj) relative difference ...
AbstractWe investigate the existence of cyclic relative difference sets with parameters ((qd−1)/(q−1...
We recursively construct a new family of (26d+4, 8, 26d+4, 26d+1) semi-regular relative difference s...
AbstractJ. A. Davis, J. Jedwab, and M. Mowbray (1998, Des. Codes Cryptogr.13, 131–146) gave two new ...
AbstractMotivated by a connection between semi-regular relative difference sets and mutually unbiase...
relative difference sets, recursive, building sets, characters We recursively construct a new family...
Motivated by a connection between semi-regular relative difference sets and mutually unbiased bases,...
We present a recursive construction for difference sets which unifies the Hadamard, McFarland, and S...
Relative Difference Sets with the parameters k = nλ have been constructed many ways (see (Davis, for...
AbstractWe present a recursive construction for difference sets which unifies the Hadamard, McFarlan...
AbstractMotivated by a connection between semi-regular relative difference sets and mutually unbiase...
AbstractWe present a recursive construction for difference sets which unifies the Hadamard, McFarlan...
AbstractWe modify and generalize the construction by McFarland (1973) in two different ways to const...
AbstractWe investigate the existence of relative (m, 2, k, λ)-difference sets in a group H × N relat...
We modify and generalize the construction by McFarland (1973) in two different ways to construct new...
Jungnickel (1982) and Elliot and Butson (1966) have shown that (pj+1,p,pj+1,pj) relative difference ...
AbstractWe investigate the existence of cyclic relative difference sets with parameters ((qd−1)/(q−1...
We recursively construct a new family of (26d+4, 8, 26d+4, 26d+1) semi-regular relative difference s...
AbstractJ. A. Davis, J. Jedwab, and M. Mowbray (1998, Des. Codes Cryptogr.13, 131–146) gave two new ...
AbstractMotivated by a connection between semi-regular relative difference sets and mutually unbiase...
relative difference sets, recursive, building sets, characters We recursively construct a new family...
Motivated by a connection between semi-regular relative difference sets and mutually unbiased bases,...
We present a recursive construction for difference sets which unifies the Hadamard, McFarland, and S...
Relative Difference Sets with the parameters k = nλ have been constructed many ways (see (Davis, for...
AbstractWe present a recursive construction for difference sets which unifies the Hadamard, McFarlan...
AbstractMotivated by a connection between semi-regular relative difference sets and mutually unbiase...
AbstractWe present a recursive construction for difference sets which unifies the Hadamard, McFarlan...
AbstractWe modify and generalize the construction by McFarland (1973) in two different ways to const...
AbstractWe investigate the existence of relative (m, 2, k, λ)-difference sets in a group H × N relat...
We modify and generalize the construction by McFarland (1973) in two different ways to construct new...
Jungnickel (1982) and Elliot and Butson (1966) have shown that (pj+1,p,pj+1,pj) relative difference ...
AbstractWe investigate the existence of cyclic relative difference sets with parameters ((qd−1)/(q−1...