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

详细信息    查看全文

• 作者：Shuxing Li ; Hengjia Wei ; Gennian Ge
• 关键词：Partitioned difference families ; Partitioned relative difference families ; Difference matrices ; Recursive constructions ; Constant composition codes
• 刊名：Designs, Codes and Cryptography
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：82
• 期：3
• 页码：583-599
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Combinatorics; Coding and Information Theory; Data Structures, Cryptology and Information Theory; Data Encryption; Discrete Mathematics in Computer Science; Information and Communication, Circuits;
• 出版者：Springer US
• ISSN：1573-7586
• 卷排序：82

文摘

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.