{"title":"Association schemes arising from non-weakly regular bent functions","authors":"Yadi Wei, Jiaxin Wang, Fang-Wei Fu","doi":"10.1007/s10623-024-01495-7","DOIUrl":null,"url":null,"abstract":"<p>Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been extensively studied. Recently, in Özbudak and Pelen (J Algebr Comb 56:635–658, 2022), Özbudak and Pelen constructed infinite families of symmetric association schemes of classes 5 and 6 by using ternary non-weakly regular bent functions. They also stated that “constructing 2<i>p</i>-class association schemes from <i>p</i>-ary non-weakly regular bent functions is an interesting problem\", where <span>\\(p>3\\)</span> is an odd prime. In this paper, using non-weakly regular bent functions, we construct infinite families of symmetric association schemes of classes 2<i>p</i>, <span>\\((2p+1)\\)</span> and <span>\\(\\frac{3p+1}{2}\\)</span> for any odd prime <i>p</i>. Fusing those association schemes, we obtain <i>t</i>-class symmetric association schemes, where <span>\\(t=4,5,6,7\\)</span>. In addition, we give the sufficient and necessary conditions for the partitions <i>P</i>, <i>D</i>, <i>T</i>, <i>U</i> and <i>V</i> (defined in this paper) to induce symmetric association schemes.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"59 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-10-04","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-01495-7","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been extensively studied. Recently, in Özbudak and Pelen (J Algebr Comb 56:635–658, 2022), Özbudak and Pelen constructed infinite families of symmetric association schemes of classes 5 and 6 by using ternary non-weakly regular bent functions. They also stated that “constructing 2p-class association schemes from p-ary non-weakly regular bent functions is an interesting problem", where \(p>3\) is an odd prime. In this paper, using non-weakly regular bent functions, we construct infinite families of symmetric association schemes of classes 2p, \((2p+1)\) and \(\frac{3p+1}{2}\) for any odd prime p. Fusing those association schemes, we obtain t-class symmetric association schemes, where \(t=4,5,6,7\). In addition, we give the sufficient and necessary conditions for the partitions P, D, T, U and V (defined in this paper) to induce symmetric association schemes.
期刊介绍:
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.