发布求助
文献互助 智能选刊 最新文献

Applicable Algebra in Engineering Communication and Computing最新文献

筛选
英文 中文
Effective algorithm for computing Noetherian operators of zero-dimensional ideals 零维理想noether算子的有效计算算法
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2022-08-08 DOI: 10.1007/s00200-022-00570-7
Katsusuke Nabeshima, Shinichi Tajima
{"title":"Effective algorithm for computing Noetherian operators of zero-dimensional ideals","authors":"Katsusuke Nabeshima,&nbsp;Shinichi Tajima","doi":"10.1007/s00200-022-00570-7","DOIUrl":"10.1007/s00200-022-00570-7","url":null,"abstract":"<div><p>We consider Noetherian operators in the context of symbolic computation. Upon utilizing the theory of holonomic <span>({mathcal D})</span>-modules, we present a new method for computing Noetherian operators associated to a zero-dimensional ideal. An effective algorithm that consists mainly of linear algebra techniques is proposed for computing them. Moreover, as applications, new computation methods of polynomial ideals are discussed by utilizing the Noetherian operators.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2022-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44198290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On cryptographic properties of cubic and splitting Boolean functions 关于三次和分裂布尔函数的密码学性质
IF 0.6 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2022-08-06 DOI: 10.1007/s00200-022-00575-2
Augustine Musukwa, Massimiliano Sala, Irene Villa, Marco Zaninelli
{"title":"On cryptographic properties of cubic and splitting Boolean functions","authors":"Augustine Musukwa,&nbsp;Massimiliano Sala,&nbsp;Irene Villa,&nbsp;Marco Zaninelli","doi":"10.1007/s00200-022-00575-2","DOIUrl":"10.1007/s00200-022-00575-2","url":null,"abstract":"<div><p>The weight, balancedness and nonlinearity are important properties of Boolean functions, but they can be difficult to determine in general. In this paper, we study how to compute them for two classes of functions where these problems are more tractable. In particular, we study functions of degree three and the so-called “splitting” functions. The latter are functions that can be written as the sum of two functions defined over disjoint sets of variables. We show how, for splitting functions, studying these properties reduces to the study of simpler functions. We provide then a procedure to compute the weight of a cubic Boolean function. We show computationally that, for a cubic Boolean function with limited number of terms, this procedure is on average significantly more efficient than some other methods.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2022-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00200-022-00575-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42127920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Strong metric dimension in annihilating-ideal graph of commutative rings 交换环的湮灭理想图中的强度量维数
IF 0.6 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2022-08-01 DOI: 10.1007/s00200-022-00574-3
Mitra Jalali, Reza Nikandish
{"title":"Strong metric dimension in annihilating-ideal graph of commutative rings","authors":"Mitra Jalali,&nbsp;Reza Nikandish","doi":"10.1007/s00200-022-00574-3","DOIUrl":"10.1007/s00200-022-00574-3","url":null,"abstract":"<div><p>In this paper, using Gallai’s Theorem and the notion of strong resolving graph, we determine the strong metric dimension in annihilating-ideal graph of commutative rings. For reduced rings, an explicit formula is given and for non-reduced rings, under some conditions, strong metric dimension is computed.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47121791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the support t-designs of extremal Type III and IV codes 关于极值III和IV型码的支持t-设计
IF 0.6 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2022-07-20 DOI: 10.1007/s00200-022-00571-6
Tsuyoshi Miezaki, Hiroyuki Nakasora
{"title":"On the support t-designs of extremal Type III and IV codes","authors":"Tsuyoshi Miezaki,&nbsp;Hiroyuki Nakasora","doi":"10.1007/s00200-022-00571-6","DOIUrl":"10.1007/s00200-022-00571-6","url":null,"abstract":"<div><p>Let <i>C</i> be an extremal Type III or IV code and <span>(D_{w})</span> be the support design of <i>C</i> for weight <i>w</i>. We introduce the numbers, <span>(delta (C))</span> and <i>s</i>(<i>C</i>), as follows: <span>(delta (C))</span> is the largest integer <i>t</i> such that, for all weights, <span>(D_{w})</span> is a <i>t</i>-design; <i>s</i>(<i>C</i>) denotes the largest integer <i>t</i> such that <i>w</i> exists and <span>(D_{w})</span> is a <i>t</i>-design. Herein, we consider the possible values of <span>(delta (C))</span> and <i>s</i>(<i>C</i>).</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2022-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47484961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Maximum distance separable repeated-root constacyclic codes over (mathbb {F}_{2^m}+umathbb {F}_{2^m}) with respect to the Lee distance 相对于李氏距离，$$mathbb {F}_{2^m}+umathbb {F}_{2^m}$$上可分离重根恒环码的最大距离
IF 0.6 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2022-07-14 DOI: 10.1007/s00200-022-00568-1
Hai Q. Dinh, Pramod Kumar Kewat, Nilay Kumar Mondal
{"title":"Maximum distance separable repeated-root constacyclic codes over (mathbb {F}_{2^m}+umathbb {F}_{2^m}) with respect to the Lee distance","authors":"Hai Q. Dinh,&nbsp;Pramod Kumar Kewat,&nbsp;Nilay Kumar Mondal","doi":"10.1007/s00200-022-00568-1","DOIUrl":"10.1007/s00200-022-00568-1","url":null,"abstract":"<div><p>Maximum distance separable (MDS) codes have the highest possible error-correcting capability among codes with the same length and size. Let <span>(gamma )</span> be nonzero in <span>(mathbb {F}_{2^m}.)</span> We consider all cyclic and <span>((1+ugamma ))</span>-constacyclic codes of length <span>(2^s)</span> over <span>(mathbb {F}_{2^m}+umathbb {F}_{2^m})</span> with their Lee distance and investigate all the cases whether the corresponding Gray images are MDS by giving an analogue of the Singleton bound for codes over <span>(mathbb {F}_{2^m}+umathbb {F}_{2^m})</span> with the Lee distance through Gray map.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2022-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47364548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
WDVV equations: symbolic computations of Hamiltonian operators WDVV方程：哈密顿算子的符号计算
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2022-07-14 DOI: 10.1007/s00200-022-00565-4
Jakub Vašíček, Raffaele Vitolo
{"title":"WDVV equations: symbolic computations of Hamiltonian operators","authors":"Jakub Vašíček,&nbsp;Raffaele Vitolo","doi":"10.1007/s00200-022-00565-4","DOIUrl":"10.1007/s00200-022-00565-4","url":null,"abstract":"<div><p>We describe software for symbolic computations that we developed in order to find Hamiltonian operators for Witten–Dijkgraaf–Verlinde–Verlinde (WDVV) equations, and verify their compatibility. The computation involves nonlocal (integro-differential) operators, for which specific canonical forms and algorithms have been used.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2022-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00200-022-00565-4.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49642862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Construction of self dual codes from graphs 从图构造自对偶码
IF 0.6 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2022-07-13 DOI: 10.1007/s00200-022-00567-2
Nazahet Fellah, Kenza Guenda, Ferruh Özbudak, Padmapani Seneviratne
{"title":"Construction of self dual codes from graphs","authors":"Nazahet Fellah,&nbsp;Kenza Guenda,&nbsp;Ferruh Özbudak,&nbsp;Padmapani Seneviratne","doi":"10.1007/s00200-022-00567-2","DOIUrl":"10.1007/s00200-022-00567-2","url":null,"abstract":"<div><p>In this work we define and study binary codes <span>(C_{q,k})</span> and <span>(overline{C_{q,k}})</span> obtained from neighborhood designs of Paley-type bipartite graphs <i>P</i>(<i>q</i>, <i>k</i>) and their complements, respectively for <i>q</i> an odd prime. We prove that for some values of <i>q</i> and <i>k</i> the codes <span>({C}_{q,k})</span> are self-dual and the codes <span>(overline{C_{q,k}})</span> are self-orthogonal. Most of these codes tend to be with optimal or near optimal parameters. Next, we extend the codes <span>(C_{q,k})</span> to get doubly even self dual codes and find that most of these codes are extremal.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2022-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42704749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Best Paper Award in Memory of Jacques Calmet 纪念雅克·卡尔梅特最佳论文奖
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2022-07-09 DOI: 10.1007/s00200-022-00572-5
{"title":"Best Paper Award in Memory of Jacques Calmet","authors":"","doi":"10.1007/s00200-022-00572-5","DOIUrl":"10.1007/s00200-022-00572-5","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50016423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Complementary decompositions of monomial ideals and involutive bases 单项式理想和对合基的互补分解
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2022-06-25 DOI: 10.1007/s00200-022-00569-0
Amir Hashemi, Matthias Orth, Werner M. Seiler
{"title":"Complementary decompositions of monomial ideals and involutive bases","authors":"Amir Hashemi,&nbsp;Matthias Orth,&nbsp;Werner M. Seiler","doi":"10.1007/s00200-022-00569-0","DOIUrl":"10.1007/s00200-022-00569-0","url":null,"abstract":"<div><p>Complementary decompositions of monomial ideals—also known as Stanley decompositions—play an important role in many places in commutative algebra. In this article, we discuss and compare several algorithms for their computation. This includes a classical recursive one, an algorithm already proposed by Janet and a construction proposed by Hironaka in his work on idealistic exponents. We relate Janet’s algorithm to the Janet tree of the Janet basis and extend this idea to Janet-like bases to obtain an optimised algorithm. We show that Hironaka’s construction terminates, if and only if the monomial ideal is quasi-stable. Furthermore, we show that in this case the algorithm of Janet determines the same decomposition more efficiently. Finally, we briefly discuss how these results can be used for the computation of primary and irreducible decompositions.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2022-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00200-022-00569-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44107487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A new construction of two-, three- and few-weight codes via our GU codes and their applications 利用我们的GU码构造二、三和少权码及其应用
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2022-06-25 DOI: 10.1007/s00200-022-00561-8
Arrieta A Eddie, Heeralal Janwa
{"title":"A new construction of two-, three- and few-weight codes via our GU codes and their applications","authors":"Arrieta A Eddie,&nbsp;Heeralal Janwa","doi":"10.1007/s00200-022-00561-8","DOIUrl":"10.1007/s00200-022-00561-8","url":null,"abstract":"<div><p>Linear codes with few weights have applications in cryptography, association schemes, designs, strongly regular graphs, finite group theory, finite geometries, and secret sharing schemes, among other disciplines. Two-weight linear codes are particularly interesting because they are closely related to objects in different areas of mathematics such as strongly regular graphs, 3-rank permutation groups, ovals, and arcs. There exist techniques to construct linear codes with few weights, for example, the systematic exposition by Calderbank and Kantor (Bull Lond Math Soc 18(2):97–122, 1986). Ding et al., (World Sci, pp 119–124, 2008) and (IEEE Trans Inf Theory 61(11):5835–5842, 2015) constructed few-weight codes using the trace function and Tonchev et al. (Algorithms, 12(8), 2019) generalized Ding’s construction. In this paper, we present an elementary way to get two- and three-weight codes from simplex codes and antipodal linear codes. An interesting application is the construction of uniformly packed linear codes from two-weight codes and quaternary quasi-perfect linear codes from three-weight codes.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2022-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48402416","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信