Association schemes arising from non-weakly regular bent functions

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2024-10-04 DOI:10.1007/s10623-024-01495-7
Yadi Wei, Jiaxin Wang, Fang-Wei Fu
{"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&gt;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.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
非弱正则弯曲函数产生的关联方案
关联方案在代数组合学中发挥着重要作用,并在编码理论、图论和设计理论中有着重要应用。利用弯曲函数构建关联方案的方法已被广泛研究。最近,在 Özbudak 和 Pelen(J Algebr Comb 56:635-658, 2022)一文中,Özbudak 和 Pelen 利用三元非弱正则弯曲函数构造了 5 类和 6 类对称关联方案的无限族。他们还指出,"从 p-ary 非弱正则弯曲函数构造 2p 类关联方案是一个有趣的问题",其中 \(p>3\) 是奇素数。在本文中,我们使用非弱正则弯曲函数,为任意奇素数 p 构建了 2p、((2p+1)\)和(\frac{3p+1}{2}\)类对称关联方案的无穷族,并融合这些关联方案,得到了 t 类对称关联方案,其中 \(t=4,5,6,7\)。此外,我们还给出了分区 P、D、T、U 和 V(本文中定义)诱导对称关联方案的充分必要条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Designs, Codes and Cryptography
Designs, Codes and Cryptography 工程技术-计算机:理论方法
CiteScore
2.80
自引率
12.50%
发文量
157
审稿时长
16.5 months
期刊介绍: 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.
期刊最新文献
Quantum rectangle attack and its application on Deoxys-BC Almost tight security in lattices with polynomial moduli—PRF, IBE, all-but-many LTF, and more Breaking the power-of-two barrier: noise estimation for BGV in NTT-friendly rings A new method of constructing $$(k+s)$$ -variable bent functions based on a family of s-plateaued functions on k variables Further investigation on differential properties of the generalized Ness–Helleseth function
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1