Ng, S.-L. and Paterson, Maura B. (2016) Disjoint difference families and their applications. Designs, Codes and Cryptography 78 (1), pp. 103-127. ISSN 0925-1022.
![[img]](https://eprints.bbk.ac.uk/style/images/fileicons/text.png) |
Text
diff-familyDCC-pre.pdf - Author's Accepted Manuscript Restricted to Repository staff only Download (409kB) |
|
|
Text
13159.pdf - Published Version of Record Available under License Creative Commons Attribution. Download (509kB) | Preview |
Abstract
Difference sets and their generalisations to difference families arise from the study of designs and many other applications. Here we give a brief survey of some of these applications, noting in particular the diverse definitions of difference families and the variations in priorities in constructions. We propose a definition of disjoint difference families that encompasses these variations and allows a comparison of the similarities and disparities. We then focus on two constructions of disjoint difference families arising from frequency hopping sequences and showed that they are in fact the same. We conclude with a discussion of the notion of equivalence for frequency hopping sequences and for disjoint difference families.
Metadata
| Item Type: | Article |
|---|---|
| Additional Information: | The final publication is available at Springer via http://dx.doi.org/10.1007/s10623-015-0149-4 |
| Keyword(s) / Subject(s): | Frequency hopping sequences, difference families, m-sequences, finite geometry |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Maura Paterson |
| Date Deposited: | 02 Dec 2015 13:16 |
| Last Modified: | 09 Aug 2023 12:37 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/13159 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
