Near-complete external difference families

James A. Davis; Sophie Huczynska; Gary L. Mullen

doi:10.1007/s10623-016-0275-7

Near-complete external difference families

James A. Davis^*, Sophie Huczynska, Gary L. Mullen

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

10 Citations (Scopus)

8 Downloads (Pure)

Abstract

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.

Original language	English
Pages (from-to)	415-424
Number of pages	10
Journal	Designs, Codes and Cryptography
Volume	84
Issue number	3
Early online date	30 Aug 2016
DOIs	https://doi.org/10.1007/s10623-016-0275-7
Publication status	Published - Sept 2017

Keywords

Difference family
Galois rings
Partial difference sets

Access to Document

10.1007/s10623-016-0275-7

Davis_2016_Near-complete_DCC_AAM
© 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
Accepted author manuscript, 235 KB

Cite this

@article{8a113fe8c8f849c08f90b2b8ceebc77c,

title = "Near-complete external difference families",

abstract = "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.",

keywords = "Difference family, Galois rings, Partial difference sets",

author = "Davis, {James A.} and Sophie Huczynska and Mullen, {Gary L.}",

year = "2017",

month = sep,

doi = "10.1007/s10623-016-0275-7",

language = "English",

volume = "84",

pages = "415--424",

journal = "Designs, Codes and Cryptography",

issn = "0925-1022",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - Near-complete external difference families

AU - Davis, James A.

AU - Huczynska, Sophie

AU - Mullen, Gary L.

PY - 2017/9

Y1 - 2017/9

N2 - 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.

AB - 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.

KW - Difference family

KW - Galois rings

KW - Partial difference sets

U2 - 10.1007/s10623-016-0275-7

DO - 10.1007/s10623-016-0275-7

M3 - Article

AN - SCOPUS:84984797679

SN - 0925-1022

VL - 84

SP - 415

EP - 424

JO - Designs, Codes and Cryptography

JF - Designs, Codes and Cryptography

IS - 3

ER -

Near-complete external difference families

Abstract

Keywords

Access to Document

Fingerprint

Cite this