A packing of partial difference sets is a collection of disjoint partial difference sets in a finite
group $ G $. This configuration has received considerable attention in design theory, finite …

Constant Amplitude (CA), Zero Auto Correlation (ZAC) sequences (or CAZAC sequences,
aka perfect sequences) have numerous applications. We generalize the CAZAC notion to …

Strong external difference families (SEDFs) and their generalizations GSEDFs and
BGSEDFs in a finite abelian group G are combinatorial designs introduced by Paterson and …

In this paper we give some necessary and sufficient conditions for Dembowski–Ostrom
polynomials to be planar. These conditions give a simple explanation of the Coulter …

Partial difference sets with parameters (v, k, λ, μ)=(v,(v− 1)/2,(v− 5)/4,(v− 1)/4) are called
Paley type partial difference sets. In this note, we prove that if there exists a Paley type …

We introduce and explore near-complete external difference families, a partitioning of the
nonidentity elements of a group so that each nonidentity element is expressible as a …

Davis and Jedwab (1997) established a great construction theory unifying many previously
known constructions of difference sets, relative difference sets and divisible difference sets …

Relatively few constructions are known of negative Latin square type Partial Difference Sets
(PDSs), and most of the known constructions are in elementary abelian groups. We present …

Partial difference sets (for short, PDSs) with parameters (n 2, r (n− ϵ), ϵ n+ r 2− 3 ϵ r, r 2− ϵ
r) are called Latin square type (respectively negative Latin square type) PDSs if ϵ= 1 …

Signed difference sets have interesting applications in communications and coding theory.
A\((v, k,\lambda)\)-difference set in a finite group G of order v is a subset D of G with k distinct …