Non-disjoint strong external difference families can have any number of sets

DOI10.1007/S00013-024-01982-2MaRDI QIDQ6438342zbMATH OpenOpenAlexFDO

Authors Sophie Huczynska, Siaw-Lynn Ng

Publication date 29 May 2023

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00013-024-01982-2

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: 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 disjointness condition is replaced by non-disjointness, then abelian SEDFs can be constructed with more than 2 sets (indeed any number of sets). We demonstrate that the non-disjoint analogue has striking differences to, and connections with, the classical SEDF and arises naturally via another coding application.

Recommendations

• Strong external difference families in abelian and non-abelian groups
• Construction and nonexistence of strong external difference families
• Existence and non-existence results for strong external difference families
• New existence and nonexistence results for strong external difference families
• Some nonexistence results for \((v,m,k,pq)\)-strong external difference families

This page was built for publication: Non-disjoint strong external difference families can have any number of sets

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