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

Mathematics

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

7 Scopus citations

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 (US)
Pages (from-to)	415-424
Number of pages	10
Journal	Designs, Codes, and Cryptography
Volume	84
Issue number	3
DOIs	https://doi.org/10.1007/s10623-016-0275-7
State	Published - Sep 1 2017

All Science Journal Classification (ASJC) codes

Computer Science Applications
Applied Mathematics

Access to Document

10.1007/s10623-016-0275-7

Fingerprint Dive into the research topics of 'Near-complete external difference families'. Together they form a unique fingerprint.

Cite this

@article{d9673b1a61584bc5bd4f1170fc952c5c,

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

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

year = "2017",

month = sep,

day = "1",

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

language = "English (US)",

volume = "84",

pages = "415--424",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Near-complete external difference families

AU - Davis, James A.

AU - Huczynska, Sophie

AU - Mullen, Gary L.

PY - 2017/9/1

Y1 - 2017/9/1

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.

UR - http://www.scopus.com/inward/record.url?scp=84984797679&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84984797679&partnerID=8YFLogxK

U2 - 10.1007/s10623-016-0275-7

DO - 10.1007/s10623-016-0275-7

M3 - Article

AN - SCOPUS:84984797679

VL - 84

SP - 415

EP - 424

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

SN - 0925-1022

IS - 3

ER -