Skip to main content
Erschienen in: Designs, Codes and Cryptography 11/2019

08.04.2019

Partitioned difference families versus zero-difference balanced functions

verfasst von: Marco Buratti, Dieter Jungnickel

Erschienen in: Designs, Codes and Cryptography | Ausgabe 11/2019

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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.
Fußnoten
1
This is a \((k\times |G_2|)\)-matrix with entries in \(G_2\) such that the differences of any two distinct rows give a permutation of \(G_2\).
 
2
We mean the graph whose vertices are the blocks of \({\mathcal {F}}\) (repeated blocks have to be considered as distinct vertices) and where two blocks are adjacent if and only if they are not disjoint.
 
Literatur
1.
Zurück zum Zitat Abel R.J.R., Buratti M.: Difference families. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 392–409. Chapman & Hall/CRC, Boca Raton, FL (2006). Abel R.J.R., Buratti M.: Difference families. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 392–409. Chapman & Hall/CRC, Boca Raton, FL (2006).
2.
Zurück zum Zitat Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999).CrossRef Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999).CrossRef
4.
Zurück zum Zitat Buratti M.: Recursive constructions for difference matrices and relative difference families. J. Comb. Des. 6, 165–182 (1998).MathSciNetCrossRef Buratti M.: Recursive constructions for difference matrices and relative difference families. J. Comb. Des. 6, 165–182 (1998).MathSciNetCrossRef
6.
Zurück zum Zitat Buratti M.: Old and new designs via difference multisets and strong difference families. J. Comb. Des. 7, 406–425 (1999).MathSciNetCrossRef Buratti M.: Old and new designs via difference multisets and strong difference families. J. Comb. Des. 7, 406–425 (1999).MathSciNetCrossRef
10.
Zurück zum Zitat Buratti M., Ghinelli D.: On disjoint \((3t,3,1)\) cyclic difference families. J. Stat. Plann. Inference 140, 1918–1922 (2010).MathSciNetCrossRef Buratti M., Ghinelli D.: On disjoint \((3t,3,1)\) cyclic difference families. J. Stat. Plann. Inference 140, 1918–1922 (2010).MathSciNetCrossRef
11.
Zurück zum Zitat Buratti M., Yan J., Wang C.: From a \(1\)-rotational RBIBD to a partitioned difference family. Electron. J. Comb. 17, \(\sharp \)R139 (2010). Buratti M., Yan J., Wang C.: From a \(1\)-rotational RBIBD to a partitioned difference family. Electron. J. Comb. 17, \(\sharp \)R139 (2010).
12.
Zurück zum Zitat Cai H., Zeng X., Helleseth T., Tang X., Yang Y.: A new construction of zero-difference balanced functions and its applications. IEEE Trans. Inf. Theory 59, 5008–5015 (2013).MathSciNetCrossRef Cai H., Zeng X., Helleseth T., Tang X., Yang Y.: A new construction of zero-difference balanced functions and its applications. IEEE Trans. Inf. Theory 59, 5008–5015 (2013).MathSciNetCrossRef
13.
Zurück zum Zitat Clay J.R.: Nearrings: Geneses and Applications. Oxford University Press, Oxford (1992).MATH Clay J.R.: Nearrings: Geneses and Applications. Oxford University Press, Oxford (1992).MATH
14.
Zurück zum Zitat Ding C.: Optimal constant composition codes from zero-difference balanced functions. IEEE Trans. Inf. Theory 54, 5766–5770 (2008).MathSciNetCrossRef Ding C.: Optimal constant composition codes from zero-difference balanced functions. IEEE Trans. Inf. Theory 54, 5766–5770 (2008).MathSciNetCrossRef
15.
Zurück zum Zitat Ding C., Yin J.: Combinatorial constructions of optimal constant composition codes. IEEE Trans. Inf. Theory 51, 3671–3674 (2005).MathSciNetCrossRef Ding C., Yin J.: Combinatorial constructions of optimal constant composition codes. IEEE Trans. Inf. Theory 51, 3671–3674 (2005).MathSciNetCrossRef
16.
Zurück zum Zitat Ding C., Wang Q., Xiong M.: Three new families of zero-difference balanced functions with applications. IEEE Trans. Inf. Theory 60, 2407–2413 (2014).MathSciNetCrossRef Ding C., Wang Q., Xiong M.: Three new families of zero-difference balanced functions with applications. IEEE Trans. Inf. Theory 60, 2407–2413 (2014).MathSciNetCrossRef
17.
Zurück zum Zitat Dinitz J.H., Rodney P.: Block disjoint difference families for Steiner triple systems. Util. Math. 52, 153–160 (1997).MathSciNetMATH Dinitz J.H., Rodney P.: Block disjoint difference families for Steiner triple systems. Util. Math. 52, 153–160 (1997).MathSciNetMATH
18.
Zurück zum Zitat Dinitz J.H., Shalaby N.: Block disjoint difference families for Steiner triple systems: \(v\equiv 3\) (mod 6). J. Stat. Plan. Inference 106, 77–86 (2002).CrossRef Dinitz J.H., Shalaby N.: Block disjoint difference families for Steiner triple systems: \(v\equiv 3\) (mod 6). J. Stat. Plan. Inference 106, 77–86 (2002).CrossRef
19.
Zurück zum Zitat Ferrero G.: Classificazione e costruzione degli stems \(P\)-singolari, Ist. Lomb. Acad. Sci. Lett. Rend. A 105, 597–613 (1968).MATH Ferrero G.: Classificazione e costruzione degli stems \(P\)-singolari, Ist. Lomb. Acad. Sci. Lett. Rend. A 105, 597–613 (1968).MATH
20.
22.
Zurück zum Zitat Jungnickel D.: Composition theorems for difference families and regular planes. Discret. Math. 23, 151–158 (1978).MathSciNetCrossRef Jungnickel D.: Composition theorems for difference families and regular planes. Discret. Math. 23, 151–158 (1978).MathSciNetCrossRef
23.
24.
Zurück zum Zitat Jungnickel D., Pott A., Smith K.W.: Difference sets. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 419–435. Chapman & Hall/CRC, Boca Raton, FL (2006). Jungnickel D., Pott A., Smith K.W.: Difference sets. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 419–435. Chapman & Hall/CRC, Boca Raton, FL (2006).
26.
Zurück zum Zitat Li S., Wei H., Ge G.: Generic constructions for partitioned difference families with applications: a unified combinatorial approach. Des. Codes Cryptogr. 82, 583–599 (2017).MathSciNetCrossRef Li S., Wei H., Ge G.: Generic constructions for partitioned difference families with applications: a unified combinatorial approach. Des. Codes Cryptogr. 82, 583–599 (2017).MathSciNetCrossRef
28.
Zurück zum Zitat Momihara K.: Disjoint difference families from Galois rings. Electron. J. Comb. 24, 3–23 (2017).MathSciNetMATH Momihara K.: Disjoint difference families from Galois rings. Electron. J. Comb. 24, 3–23 (2017).MathSciNetMATH
30.
Zurück zum Zitat Wilson R.M.: Cyclotomic and difference families in elementary abelian groups. J. Number Theory 4, 17–47 (1972).MathSciNetCrossRef Wilson R.M.: Cyclotomic and difference families in elementary abelian groups. J. Number Theory 4, 17–47 (1972).MathSciNetCrossRef
Metadaten
Titel
Partitioned difference families versus zero-difference balanced functions
verfasst von
Marco Buratti
Dieter Jungnickel
Publikationsdatum
08.04.2019
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 11/2019
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-019-00632-x

Weitere Artikel der Ausgabe 11/2019

Designs, Codes and Cryptography 11/2019 Zur Ausgabe