{"title":"循环外部差异族:构建与不存在","authors":"Huawei Wu, Jing Yang, Keqin Feng","doi":"10.1007/s10623-024-01443-5","DOIUrl":null,"url":null,"abstract":"<p>The circular external difference family and its strong version are of great significance both in theory and in applications. In this paper, we apply the classical cyclotomic construction to the circular external differnece family and exhibit several concrete examples, in particular constructing an infinite family. Furthermore, we prove that all strong circular external differnece families are constructed by patching together several strong external difference families consisting of two subsets, thereby solving the open problem raised by Veitch and Stinson. We also present a new result on the non-existence of a certain type of strong external difference families.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"28 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Circular external difference families: construction and non-existence\",\"authors\":\"Huawei Wu, Jing Yang, Keqin Feng\",\"doi\":\"10.1007/s10623-024-01443-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The circular external difference family and its strong version are of great significance both in theory and in applications. In this paper, we apply the classical cyclotomic construction to the circular external differnece family and exhibit several concrete examples, in particular constructing an infinite family. Furthermore, we prove that all strong circular external differnece families are constructed by patching together several strong external difference families consisting of two subsets, thereby solving the open problem raised by Veitch and Stinson. We also present a new result on the non-existence of a certain type of strong external difference families.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"28 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Designs, Codes and Cryptography\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-024-01443-5\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01443-5","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Circular external difference families: construction and non-existence
The circular external difference family and its strong version are of great significance both in theory and in applications. In this paper, we apply the classical cyclotomic construction to the circular external differnece family and exhibit several concrete examples, in particular constructing an infinite family. Furthermore, we prove that all strong circular external differnece families are constructed by patching together several strong external difference families consisting of two subsets, thereby solving the open problem raised by Veitch and Stinson. We also present a new result on the non-existence of a certain type of strong external difference families.
期刊介绍:
Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines.
The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome.
The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas.
Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.