## Abstract External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. Some results had been obtained by Chang and Ding, the connection between EDFs and disjoint difference families (DDFs) was also established. In this paper, further cyclotomic constru
Recursive constructions for difference matrices and relative difference families
β Scribed by Marco Buratti
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 219 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
We present a new recursive construction for difference matrices whose application allows us to improve some results by D. Jungnickel. For instance, we prove that for any Abelian p-group G of type (n1 , n2 , . . . , nt) there exists a (G, p e , 1) difference matrix with e = Ξ£ i n i m ax i n i . Also, we prove that for any group G there exists a (G, p, 1) difference matrix where p is the smallest prime dividing |G|. Difference matrices are then used for constructing, recursively, relative difference families. We revisit some constructions by M.
π SIMILAR VOLUMES
## Abstract In this article, we construct a (6__p__, 5, 1) cyclic difference matrix with one hole of size 6 for any prime __p__β>β5 and a (2__p__, 5, 1) cyclic difference matrix with one hole of size 2 for any prime __p__ββ‘β1, 13 or 17 (mod 24). Β© 2006 Wiley Periodicals, Inc. J Combin Designs 14: 3
In this paper, a new family of relative difference sets with parameters Γ°m; n; k; lΓ ΒΌ ððq 7 Γ 1Γ=Γ°q Γ 1Γ; 4Γ°q Γ 1Γ; q 6 ; q 5 =4Γ is constructed where q is a 2-power. The construction is based on the technique used in [2]. By a similar method, we also construct some new circulant weighing matrices
## Abstract The existence problems of perfect difference families with block size __k__, __k__=4,5, and additive sequences of permutations of length __n__, __n__=3,4, are two outstanding open problems in combinatorial design theory for more than 30 years. In this article, we mainly investigate perf
An (n, m, w)-perfect hash family is a set of functions F such that f : (1
## Abstract In this article, two constructions of (__v__, (__v__βββ1)/2, (__v__βββ3)/2) difference families are presented. The first construction produces both cyclic and noncyclic difference families, while the second one gives only cyclic difference families. The parameters of the second construc