Partitioned difference families versus zero-difference balanced functions

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 resul...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Designs, codes, and cryptography codes, and cryptography, 2019-11, Vol.87 (11), p.2461-2467
Hauptverfasser: Buratti, Marco, Jungnickel, Dieter
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 2467
container_issue 11
container_start_page 2461
container_title Designs, codes, and cryptography
container_volume 87
creator Buratti, Marco
Jungnickel, Dieter
description 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.
doi_str_mv 10.1007/s10623-019-00632-x
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2305106600</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2305106600</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-13fc54c80242847004ccb46e2e927af0a666b24d5b54e5683c894cc465fa8c413</originalsourceid><addsrcrecordid>eNp9kE1Lw0AURQdRsFb_gKuA69E3n0mWUtQWCrrQ9TCZvJGUNKkziVR_vVMj6MrVXbx77oNDyCWDawaQ30QGmgsKrKQAWnC6PyIzpnJBc1XoYzKDkivKgPNTchbjBgCYAD4jqycbhmZo-g7rrG68x4Cdw8zbbdM2GLN3DHGM2SeGnv65V7a1KevMj5074PGcnHjbRrz4yTl5ub97Xizp-vFhtbhdUydYOVAmvFPSFcAlL2QOIJ2rpEaOJc-tB6u1rrisVaUkKl0IV5SpIrXytnCSiTm5mnZ3oX8bMQ5m04-hSy8NF6CSCA2QWnxqudDHGNCbXWi2NnwYBuagzEzKTFJmvpWZfYLEBMVU7l4x_E7_Q30BLoZvJw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2305106600</pqid></control><display><type>article</type><title>Partitioned difference families versus zero-difference balanced functions</title><source>Springer Nature - Complete Springer Journals</source><creator>Buratti, Marco ; Jungnickel, Dieter</creator><creatorcontrib>Buratti, Marco ; Jungnickel, Dieter</creatorcontrib><description>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.</description><identifier>ISSN: 0925-1022</identifier><identifier>EISSN: 1573-7586</identifier><identifier>DOI: 10.1007/s10623-019-00632-x</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Circuits ; Codes ; Coding and Information Theory ; Computer Science ; Cryptology ; Data Structures and Information Theory ; Discrete Mathematics in Computer Science ; Frequencies ; Information and Communication</subject><ispartof>Designs, codes, and cryptography, 2019-11, Vol.87 (11), p.2461-2467</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2019</rights><rights>Copyright Springer Nature B.V. 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-13fc54c80242847004ccb46e2e927af0a666b24d5b54e5683c894cc465fa8c413</citedby><cites>FETCH-LOGICAL-c319t-13fc54c80242847004ccb46e2e927af0a666b24d5b54e5683c894cc465fa8c413</cites><orcidid>0000-0003-1140-2251</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10623-019-00632-x$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10623-019-00632-x$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Buratti, Marco</creatorcontrib><creatorcontrib>Jungnickel, Dieter</creatorcontrib><title>Partitioned difference families versus zero-difference balanced functions</title><title>Designs, codes, and cryptography</title><addtitle>Des. Codes Cryptogr</addtitle><description>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.</description><subject>Circuits</subject><subject>Codes</subject><subject>Coding and Information Theory</subject><subject>Computer Science</subject><subject>Cryptology</subject><subject>Data Structures and Information Theory</subject><subject>Discrete Mathematics in Computer Science</subject><subject>Frequencies</subject><subject>Information and Communication</subject><issn>0925-1022</issn><issn>1573-7586</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp9kE1Lw0AURQdRsFb_gKuA69E3n0mWUtQWCrrQ9TCZvJGUNKkziVR_vVMj6MrVXbx77oNDyCWDawaQ30QGmgsKrKQAWnC6PyIzpnJBc1XoYzKDkivKgPNTchbjBgCYAD4jqycbhmZo-g7rrG68x4Cdw8zbbdM2GLN3DHGM2SeGnv65V7a1KevMj5074PGcnHjbRrz4yTl5ub97Xizp-vFhtbhdUydYOVAmvFPSFcAlL2QOIJ2rpEaOJc-tB6u1rrisVaUkKl0IV5SpIrXytnCSiTm5mnZ3oX8bMQ5m04-hSy8NF6CSCA2QWnxqudDHGNCbXWi2NnwYBuagzEzKTFJmvpWZfYLEBMVU7l4x_E7_Q30BLoZvJw</recordid><startdate>20191101</startdate><enddate>20191101</enddate><creator>Buratti, Marco</creator><creator>Jungnickel, Dieter</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0003-1140-2251</orcidid></search><sort><creationdate>20191101</creationdate><title>Partitioned difference families versus zero-difference balanced functions</title><author>Buratti, Marco ; Jungnickel, Dieter</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-13fc54c80242847004ccb46e2e927af0a666b24d5b54e5683c894cc465fa8c413</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Circuits</topic><topic>Codes</topic><topic>Coding and Information Theory</topic><topic>Computer Science</topic><topic>Cryptology</topic><topic>Data Structures and Information Theory</topic><topic>Discrete Mathematics in Computer Science</topic><topic>Frequencies</topic><topic>Information and Communication</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Buratti, Marco</creatorcontrib><creatorcontrib>Jungnickel, Dieter</creatorcontrib><collection>CrossRef</collection><jtitle>Designs, codes, and cryptography</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Buratti, Marco</au><au>Jungnickel, Dieter</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Partitioned difference families versus zero-difference balanced functions</atitle><jtitle>Designs, codes, and cryptography</jtitle><stitle>Des. Codes Cryptogr</stitle><date>2019-11-01</date><risdate>2019</risdate><volume>87</volume><issue>11</issue><spage>2461</spage><epage>2467</epage><pages>2461-2467</pages><issn>0925-1022</issn><eissn>1573-7586</eissn><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.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10623-019-00632-x</doi><tpages>7</tpages><orcidid>https://orcid.org/0000-0003-1140-2251</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0925-1022
ispartof Designs, codes, and cryptography, 2019-11, Vol.87 (11), p.2461-2467
issn 0925-1022
1573-7586
language eng
recordid cdi_proquest_journals_2305106600
source Springer Nature - Complete Springer Journals
subjects Circuits
Codes
Coding and Information Theory
Computer Science
Cryptology
Data Structures and Information Theory
Discrete Mathematics in Computer Science
Frequencies
Information and Communication
title Partitioned difference families versus zero-difference balanced functions
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T06%3A33%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Partitioned%20difference%20families%20versus%20zero-difference%20balanced%20functions&rft.jtitle=Designs,%20codes,%20and%20cryptography&rft.au=Buratti,%20Marco&rft.date=2019-11-01&rft.volume=87&rft.issue=11&rft.spage=2461&rft.epage=2467&rft.pages=2461-2467&rft.issn=0925-1022&rft.eissn=1573-7586&rft_id=info:doi/10.1007/s10623-019-00632-x&rft_dat=%3Cproquest_cross%3E2305106600%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2305106600&rft_id=info:pmid/&rfr_iscdi=true