相关论文: Existence and Non-Existence Results for Strong Ext…

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…

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…

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…

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$.

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…

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…

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…

Classical strong external difference families (SEDFs) are much-studied combinatorial structures motivated by information security applications; it is conjectured that only one classical abelian SEDF exists with more than two sets. Recently,…

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…

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…

(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…

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…

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…

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…

A generalized strong external difference family (briefly $(v, m; k_1,\dots,k_m; \lambda_1,\dots,\lambda_m)$-GSEDF) was introduced by Paterson and Stinson in 2016. In this paper, we construct some new GSEDFs for $m=2$ and use them to obtain…

Strong difference families are an interesting class of discrete structures which can be used to derive relative difference families. Relative difference families are closely related to $2$-designs, and have applications in constructions for…

This paper provides a combinatorial characterization of weak algebraic manipulation detection (AMD) codes via a kind of generalized external difference families called bounded standard weighted external difference families (BSWEDFs). By…

In this paper, we provide a mathematical framework for characterizing AMD codes that are R-optimal. We introduce a new combinatorial object, the reciprocally-weighted external difference family (RWEDF), which corresponds precisely to an…

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 difference families of special types are introduced to produce new relative difference families from the point of view of both asymptotic existences and concrete examples. As applications, group divisible designs of type $30^u$ with…