Constructions of partitioned difference families

Authors:
Jianxing Yin;Xiuling Shan;Zihong Tian
Affiliations:
Department of Mathematics, Suzhou University, Suzhou 215006, China;Institute of Mathematics, Hebei Normal University, Shijiazhuang 050016, China;Institute of Mathematics, Hebei Normal University, Shijiazhuang 050016, China
Venue:
European Journal of Combinatorics
Year:
2008

Citing 7
Cited 1

Design theory

Design theory
Constructions of External Difference Families and Disjoint Difference Families

Designs, Codes and Cryptography
On constant composition codes

Discrete Applied Mathematics
Almost difference sets and their sequences with optimal autocorrelation

IEEE Transactions on Information Theory
On constant-composition codes over Zq

IEEE Transactions on Information Theory
Combinatorial constructions of optimal constant-composition codes

IEEE Transactions on Information Theory
Partitions of difference sets and code synchronization

Finite Fields and Their Applications

Constructions of a class of partition difference family

IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application

Quantified Score

Hi-index	0.01

Visualization

Abstract

Partitioned difference families (PDFs) arise from constructions of optimum constant composition codes. In this paper, a number of infinite classes of PDFs are constructed, based on known cyclotomic difference families in GF(q). A general approach which obtains PDFs from difference packings and coverings in abelian group is also presented.