Construction and nonexistence of strong external difference families

DOI10.1007/S10801-018-0812-8zbMATH Open1480.05021OpenAlexW2964086002MaRDI QIDQ2633458FDOQ2633458

Authors Shuxing Li, Jonathan Jedwab 

Publication date 8 May 2019

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1701.05705

zbMATH Keywords

Mathieu groupcharacter sumpartial difference setfinite projective geometryexponent boundstrong external difference family

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial aspects of finite geometries (05B25)

Abstract: 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 characterize the parameters $(v,m,k,lambda)$ of a nontrivial SEDF that is near-complete (satisfying $v=km+1$). We construct the first known nontrivial example of a $(v,m,k,lambda)$ SEDF having $m>2$. The parameters of this example are $(243,11,22,20)$, giving a near-complete SEDF, and its group is $mathbb{Z}_3^5$. We provide a comprehensive framework for the study of SEDFs using character theory and algebraic number theory, showing that the cases $m=2$ and $m>2$ are fundamentally different. We prove a range of nonexistence results, greatly narrowing the scope of possible parameters of SEDFs.

Recommendations

• Existence and non-existence results for strong external difference families
• Some Nonexistence Results for Strong External Difference Families Using Character Theory
• New existence and nonexistence results for strong external difference families
• Cyclotomic construction of strong external difference families in finite fields
• Strong external difference families in abelian and non-abelian groups

Cites Work

• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• scientific article; zbMATH DE number 3407720 (Why is no real title available?)
• A survey of partial difference sets
• Algebraic manipulation detection codes
• Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
• Combinatorial problems motivated by comma‐free codes
• Constructions of external difference families and disjoint difference families
• Cyclotomic construction of strong external difference families in finite fields
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Existence and non-existence results for strong external difference families
• Near-complete external difference families
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• New existence and nonexistence results for strong external difference families
• On Abelian \((2n,n,2n,2)\)-difference sets
• On Orthogonal Matrices
• Optimal algebraic manipulation detection codes in the constant-error model
• Paley type partial difference sets in non \(p\)-groups
• Partial Difference Sets with Paley Parameters
• Polynomial addition sets and polynomial digraphs
• Primary cyclotomic units and a proof of Catalans conjecture
• Some Nonexistence Results for Strong External Difference Families Using Character Theory
• Strongly regular Cayley graphs with \(\lambda-\mu=-1\)
• The Geometry of Two-Weight Codes
• Two constructions of (v, (v − 1)/2, (v − 3)/2) difference families

Cited In (18)

• Strong difference families of special types
• Existence and non-existence results for strong external difference families
• Circular external difference families, graceful labellings and cyclotomy
• Internal and external partial difference families and cyclotomy
• Existence question for difference families and construction of some new families
• Heffter spaces
• Decomposing complete graphs into isomorphic complete multipartite graphs
• Non-disjoint strong external difference families can have any number of sets
• Algebraic manipulation detection codes via highly nonlinear functions
• Strong external difference families in abelian and non-abelian groups
• Nonexistence of strong external difference families in abelian groups of order being product of at most three primes
• Circular external difference families: construction and non-existence
• Some Nonexistence Results for Strong External Difference Families Using Character Theory
• On optimal weak algebraic manipulation detection codes and weighted external difference families
• Some nonexistence results for \((v,m,k,pq)\)-strong external difference families
• Cyclotomic construction of strong external difference families in finite fields
• New existence and nonexistence results for strong external difference families
• Some results on generalized strong external difference families

Uses Software

• ATLAS Group Representations

This page was built for publication: Construction and nonexistence of strong external difference families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633458)