Some results on generalized strong external difference families
From MaRDI portal
(Redirected from Publication:1801100)
Abstract: A generalized strong external difference family (briefly -GSEDF) was introduced by Paterson and Stinson in 2016. In this paper, we construct some new GSEDFs for and use them to obtain some results on graph decomposition. We also give some nonexistence results for GSEDFs. Especially, we prove that a -GSEDF does not exist when .
Recommendations
- New existence and nonexistence results for strong external difference families
- Construction and nonexistence of strong external difference families
- Existence and non-existence results for strong external difference families
- Some nonexistence results for \((v,m,k,pq)\)-strong external difference families
- Some Nonexistence Results for Strong External Difference Families Using Character Theory
Cites work
- A Family of Difference Sets
- Algebraic manipulation detection codes
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
- Combinatorial Designs
- Construction and nonexistence of strong external difference families
- Cyclic difference sets
- Cyclotomic construction of strong external difference families in finite fields
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Difference sets in noncyclic Abelian groups
- Existence and non-existence results for strong external difference families
- Graph theory
- scientific article; zbMATH DE number 4014968 (Why is no real title available?)
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3790437 (Why is no real title available?)
- New existence and nonexistence results for strong external difference families
- Optimal algebraic manipulation detection codes in the constant-error model
- Some Nonexistence Results for Strong External Difference Families Using Character Theory
- The CRC handbook of combinatorial designs
Cited in
(17)- Weighted external difference families and R-optimal AMD codes
- Cyclotomic construction of strong external difference families in finite fields
- New existence and nonexistence results for strong external difference families
- Algebraic manipulation detection codes via highly nonlinear functions
- Strong external difference families in abelian and non-abelian groups
- Some nonexistence results for \((v,m,k,pq)\)-strong external difference families
- Nonexistence of strong external difference families in abelian groups of order being product of at most three primes
- Strong difference families of special types
- Existence and non-existence results for strong external difference families
- Existence of (q,3 2,1)-external difference families
- External difference families from Gauss sums.
- Some Nonexistence Results for Strong External Difference Families Using Character Theory
- Decomposing complete graphs into isomorphic complete multipartite graphs
- Circular external difference families: construction and non-existence
- Near-factorizations of dihedral groups
- New results on non-disjoint and classical strong external difference families
- On optimal weak algebraic manipulation detection codes and weighted external difference families
This page was built for publication: Some results on generalized strong external difference families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801100)