Related papers: New results on non-disjoint and classical strong e…
Strong external difference families (SEDFs) are much-studied combinatorial objects motivated by an information security application. A well-known conjecture states that only one abelian SEDF with more than 2 sets exists. We show that if the…
Strong external difference families (SEDFs) have applications to cryptography and are rich combinatorial structures in their own right; until now, all SEDFs have been in abelian groups. In this paper, we consider SEDFs in both abelian and…
External difference families (EDFs) are combinatorial objects which were introduced in the early 2000s, motivated by information security applications such as the construction of AMD codes. Various generalizations have since been defined…
Strong external difference family (SEDF) and its generalizations GSEDF, BGSEDF in a finite abelian group $G$ are combinatorial designs raised by Paterson and Stinson [7] in 2016 and have applications in communication theory to construct…
We consider strong external difference families (SEDFs); these are external difference families satisfying additional conditions on the patterns of external diferences that occur, and were first defined in the context of classifying optimal…
Strong external difference families (SEDFs) were introduced by Paterson and Stinson as a more restrictive version of external difference families. SEDFs can be used to produce optimal strong algebraic manipulation detection codes. In this…
We introduce the concept of a disjoint partial difference family (DPDF) and an external partial difference family (EPDF), a natural generalisation of the much-studied structures of disjoint difference family (DDF), external difference…
Strong external difference families (SEDFs) were introduced by Paterson and Stinson as a more restrictive version of external difference families. SEDFs can be used to produce optimal strong algebraic manipulation detection codes. We…
Recently, new combinatorial structures called disjoint partial difference families (DPDFs) and external partial difference families (EPDFs) were introduced, which simultaneously generalize partial difference sets, disjoint difference…
(Strong) circular external difference families (which we denote as CEDFs and SCEDFs) can be used to construct nonmalleable threshold schemes. They are a variation of (strong) external difference families, which have been extensively studied…
In this paper, we use character-theoretic techniques to give new nonexistence results for $(n,m,k,\lambda)$-strong external difference families (SEDFs). We also use cyclotomic classes to give two new classes of SEDFs with $m=2$.
The circular external difference family and its strong version, which themselves are of independent combinatorial interest, were proposed as variants of the difference family to construct new unconditionally secure non-malleable threshold…
The notion of strong external difference family (SEDF) in a finite abelian group $(G,+)$ is raised by M. B. Paterson and D. R. Stinson [5] in 2016 and motivated by its application in communication theory to construct $R$-optimal regular…
One method of constructing $(a^2+1, 2,a, 1)$-SEDFs (i.e., strong external difference families) in $\mathbb{Z}_{a^2+1}$ makes use of $\alpha$-valuations of complete bipartite graphs $K_{a,a}$. We explore this approach and we provide a…
Circular external difference families (CEDFs) are a recently-introduced variation of external difference families with applications to non-malleable threshold schemes: a $(v,m,\ell,1)$-CEDF is an $m$-sequence $(A_0, \ldots, A_{m-1})$ of…
A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…
Skew partial difference sets (skew PDSs) are recently-introduced combinatorial objects closely related to partial difference sets (PDSs). To date, only one construction approach for non-trivial skew PDSs is known, using bent partitions:…
In this paper, we study the existence of $(v,m,k,\lambda)$-strong external difference families (SEDFs). We use character-theoretic techniques to show that no SEDF exists when $v$ is prime, $k > 1$ and $m > 2$. In the case where $v$ is the…
Difference sets have been studied for more than 80 years. Techniques from algebraic number theory, group theory, finite geometry, and digital communications engineering have been used to establish constructive and nonexistence results. We…
In this paper, six constructions of difference families are presented. These constructions make use of difference sets, almost difference sets and disjoint difference families, and give new point of views of relationships among these…