Near-complete external difference families
MetadataShow full item record
We introduce and explore near-complete external difference families, a partitioning of the nonidentity elements of a group so that each nonidentity element is expressible as a difference of elements from distinct subsets a fixed number of times. We show that the existence of such an object implies the existence of a near-resolvable design. We provide examples and general constructions of these objects, some of which lead to new parameter families of near-resolvable designs on a non-prime-power number of points. Our constructions employ cyclotomy, partial difference sets, and Galois rings.
Davis , J A , Huczynska , S & Mullen , G L 2017 , ' Near-complete external difference families ' Designs, Codes and Cryptography , vol. 84 , no. 3 , pp. 415-424 . DOI: 10.1007/s10623-016-0275-7
Designs, Codes and Cryptography
© 2016, Springer. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at link.springer.com / https://doi.org/10.1007/s10623-016-0275-7
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.