Generic constructions for partitioned difference families with applications: a unified combinatorial approach

Shuxing Li, Hengjia Wei, Gennian Ge

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

Partitioned difference families are an interesting class of discrete structures which can be used to derive optimal constant composition codes. There have been intensive researches on the construction of partitioned difference families. In this paper, we consider the combinatorial approach. We introduce a new combinatorial configuration named partitioned relative difference family, which proves to be very powerful in the construction of partitioned difference families. In particular, we present two general recursive constructions, which not only include some existing constructions as special cases, but also generate many new series of partitioned difference families. As an application, we use these partitioned difference families to construct several new classes of optimal constant composition codes.

Original languageEnglish
Pages (from-to)583-599
Number of pages17
JournalDesigns, Codes, and Cryptography
Volume82
Issue number3
DOIs
StatePublished - 1 Mar 2017
Externally publishedYes

Keywords

  • Constant composition codes
  • Difference matrices
  • Partitioned difference families
  • Partitioned relative difference families
  • Recursive constructions

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Generic constructions for partitioned difference families with applications: a unified combinatorial approach'. Together they form a unique fingerprint.

Cite this