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 language | English |
---|---|
Pages (from-to) | 583-599 |
Number of pages | 17 |
Journal | Designs, Codes, and Cryptography |
Volume | 82 |
Issue number | 3 |
DOIs | |
State | Published - 1 Mar 2017 |
Externally published | Yes |
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