Files in this item
Non-disjoint strong external difference families can have any number of sets
Item metadata
dc.contributor.author | Huczynska, Sophie | |
dc.contributor.author | Ng, Siaw-Lynn | |
dc.date.accessioned | 2024-05-01T16:30:03Z | |
dc.date.available | 2024-05-01T16:30:03Z | |
dc.date.issued | 2024-04-30 | |
dc.identifier | 300761848 | |
dc.identifier | cfb2ec2a-0f12-4738-b370-be89849086e3 | |
dc.identifier | 85191765303 | |
dc.identifier.citation | Huczynska , S & Ng , S-L 2024 , ' Non-disjoint strong external difference families can have any number of sets ' , Archiv der Mathematik . https://doi.org/10.1007/s00013-024-01982-2 | en |
dc.identifier.issn | 0003-889X | |
dc.identifier.other | ORCID: /0000-0002-0626-7932/work/159010018 | |
dc.identifier.uri | https://hdl.handle.net/10023/29789 | |
dc.description | Funding: Engineering and Physical Sciences Research Council (Grant number EP/X021157/1). | en |
dc.description.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. | |
dc.format.extent | 11 | |
dc.format.extent | 335711 | |
dc.language.iso | eng | |
dc.relation.ispartof | Archiv der Mathematik | en |
dc.subject | Strong external difference families | en |
dc.subject | External difference families | en |
dc.subject | Binary sequences | en |
dc.subject | Optical orthogonal codes | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | Non-disjoint strong external difference families can have any number of sets | en |
dc.type | Journal article | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.identifier.doi | 10.1007/s00013-024-01982-2 | |
dc.description.status | Peer reviewed | en |
dc.identifier.grantnumber | EP/X021157/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.