Skip to main content


Weitere Artikel dieser Ausgabe durch Wischen aufrufen


Partitioned difference families versus zero-difference balanced functions

Designs, Codes and Cryptography
Marco Buratti, Dieter Jungnickel
Wichtige Hinweise
Communicated by M. Paterson.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.


In a recent paper by the first author in this journal it was pointed out that the literature on zero-difference balanced functions is often repetitive and of little value. Indeed it was shown that some papers published in the last decade on this topic reproduced in a very convoluted way simple results on difference families which were known since the 90s or even earlier. In spite of this fact, unfortunately, a new paper of the same kind has recently appeared in this journal. Its main result was indeed already obtained by Furino in 1991 and here it will be shown that it is only a very special case of a much more general result by the first author. We take this opportunity to make a comparison between the equivalent notions of a partitioned difference family (PDF) and a zero-difference balanced function (ZDBF), explaining the reasons for which we prefer to adopt the terminology and notation of PDFs. Finally, “playing” with some known results on difference families, we produce a plethora of disjoint difference families with new parameters. Each of them can be viewed as a PDF with many blocks of size 1; therefore, even though the ZDBF community do not appear concerned about this, they are not so relevant from the design theory perspective. The main goal of this note is to explain the relationships between ZDBFs and the prior research, giving an example of how seemingly novel ZBDF results can be readily obtained from well known results on difference families.

Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten

Über diesen Artikel

Premium Partner