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

Applicable Algebra in Engineering Communication and Computing最新文献

筛选
英文 中文
Linear label code of a root lattice using Gröbner bases 线性标签代码的根晶格使用Gröbner的基础
IF 0.6 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-07-28 DOI: 10.1007/s00200-023-00614-6
Malihe Aliasgari, Daniel Panario, Mohammad-Reza Sadeghi
{"title":"Linear label code of a root lattice using Gröbner bases","authors":"Malihe Aliasgari,&nbsp;Daniel Panario,&nbsp;Mohammad-Reza Sadeghi","doi":"10.1007/s00200-023-00614-6","DOIUrl":"10.1007/s00200-023-00614-6","url":null,"abstract":"<div><p>The label code of a lattice plays a key role in the characterization of the lattice. Every lattice <span>(Lambda)</span> can be described in terms of a label code <i>L</i> and an orthogonal sublattice <span>(Lambda ')</span> such that <span>(Lambda /Lambda 'cong L)</span>. We identify the binomial ideal associated to an integer lattice and then establish a relation between the ideal quotient of the lattice and its label code. Furthermore, we present the Gröbner basis of the well-known root lattice <span>(D_n)</span>. As an application of the relation <span>(I_{Lambda }=I_{Lambda '}+I_{L})</span>, where <span>(I_{Lambda },I_{Lambda '})</span> and <span>(I_L)</span> denote binomial ideals associated to <span>(Lambda ,~Lambda ')</span> and <i>L</i>, respectively, a linear label code of <span>(D_n)</span> is obtained using its Gröbner basis.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48057651","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
Further perspectives on elimination 关于消除的进一步观点
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-07-20 DOI: 10.1007/s00200-023-00618-2
Teo Mora
{"title":"Further perspectives on elimination","authors":"Teo Mora","doi":"10.1007/s00200-023-00618-2","DOIUrl":"10.1007/s00200-023-00618-2","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44365194","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
Dihedral codes with 1-dimensional hulls and 1-dimensional linear complementary pairs of dihedral codes 具有一维外壳的二面体码和一维线性互补对二面体代码
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-07-19 DOI: 10.1007/s00200-023-00617-3
S. Dougherty, S. Șahinkaya, Deniz Ustun
{"title":"Dihedral codes with 1-dimensional hulls and 1-dimensional linear complementary pairs of dihedral codes","authors":"S. Dougherty, S. Șahinkaya, Deniz Ustun","doi":"10.1007/s00200-023-00617-3","DOIUrl":"https://doi.org/10.1007/s00200-023-00617-3","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45259924","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}
引用次数: 1
Constructing doubly even self-dual codes and even unimodular lattices from Hadamard matrices 从Hadamard矩阵构造双偶自对偶码和偶单模格
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-07-14 DOI: 10.1007/s00200-023-00615-5
D. Crnković, Andrea Švob
{"title":"Constructing doubly even self-dual codes and even unimodular lattices from Hadamard matrices","authors":"D. Crnković, Andrea Švob","doi":"10.1007/s00200-023-00615-5","DOIUrl":"https://doi.org/10.1007/s00200-023-00615-5","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47782694","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}
引用次数: 1
Correction: The paint pot problem and common multiples in monoids 更正:油漆罐问题和常见的倍数在monoids
4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-06-14 DOI: 10.1007/s00200-023-00613-7
Hans Zantema, Vincent van Oostrom
{"title":"Correction: The paint pot problem and common multiples in monoids","authors":"Hans Zantema, Vincent van Oostrom","doi":"10.1007/s00200-023-00613-7","DOIUrl":"https://doi.org/10.1007/s00200-023-00613-7","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135916460","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
Frobenius pseudo-variety of numerical semigroups with a given multiplicity and ratio 具有给定多重性和比率的数值半群的Frobenius伪变种
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-06-08 DOI: 10.1007/s00200-023-00610-w
M. A. Moreno-Frías, J. Rosales
{"title":"Frobenius pseudo-variety of numerical semigroups with a given multiplicity and ratio","authors":"M. A. Moreno-Frías, J. Rosales","doi":"10.1007/s00200-023-00610-w","DOIUrl":"https://doi.org/10.1007/s00200-023-00610-w","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48868476","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 higher-order nonlinearity of a new class of biquadratic Maiorana–McFarland type bent functions 关于一类新的双二次Maiorana–McFarland型弯曲函数的高阶非线性
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-05-31 DOI: 10.1007/s00200-023-00611-9
Kezia Saini, M. Garg
{"title":"On the higher-order nonlinearity of a new class of biquadratic Maiorana–McFarland type bent functions","authors":"Kezia Saini, M. Garg","doi":"10.1007/s00200-023-00611-9","DOIUrl":"https://doi.org/10.1007/s00200-023-00611-9","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47431444","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
MWS and FWS codes for coordinate-wise weight functions 坐标加权函数的MWS和FWS代码
4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-05-19 DOI: 10.1007/s00200-023-00608-4
Tim Alderson, Benjamin Morine
{"title":"MWS and FWS codes for coordinate-wise weight functions","authors":"Tim Alderson, Benjamin Morine","doi":"10.1007/s00200-023-00608-4","DOIUrl":"https://doi.org/10.1007/s00200-023-00608-4","url":null,"abstract":"A combinatorial problem concerning the maximum size of the (Hamming) weight set of an $$[n,k]_q$$ linear code was recently introduced. Codes attaining the established upper bound are the Maximum Weight Spectrum (MWS) codes. Those $$[n,k]_q$$ codes with the same weight set as $$mathbb {F}_q^n$$ are called Full Weight Spectrum (FWS) codes. FWS codes are necessarily “short”, whereas MWS codes are necessarily “long”. For fixed k, q the values of n for which an $$[n,k]_q$$ -FWS code exists are completely determined, but the determination of the minimum length M(H, k, q) of an $$[n,k]_q$$ -MWS code remains an open problem. The current work broadens discussion first to general coordinate-wise weight functions, and then specifically to the Lee weight and a Manhattan like weight. In the general case we provide bounds on n for which an FWS code exists, and bounds on n for which an MWS code exists. When specializing to the Lee or to the Manhattan setting we are able to completely determine the parameters of FWS codes. As with the Hamming case, we are able to provide an upper bound on $$M({mathscr {L}},k,q)$$ (the minimum length of Lee MWS codes), and pose the determination of $$M({mathscr {L}},k,q)$$ as an open problem. On the other hand, with respect to the Manhattan weight we completely determine the parameters of MWS codes.","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135576353","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
Correction: Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes 更正：通过重复根循环码的扭转度确定最小符号对和 RT 权重
IF 0.6 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-05-17 DOI: 10.1007/s00200-023-00609-3
Boran Kim
{"title":"Correction: Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes","authors":"Boran Kim","doi":"10.1007/s00200-023-00609-3","DOIUrl":"10.1007/s00200-023-00609-3","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135861225","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
The paint pot problem and common multiples in monoids 油漆罐问题和一元群的公倍数
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-05-13 DOI: 10.1007/s00200-023-00606-6
H. Zantema, Vincent van Oostrom
{"title":"The paint pot problem and common multiples in monoids","authors":"H. Zantema, Vincent van Oostrom","doi":"10.1007/s00200-023-00606-6","DOIUrl":"https://doi.org/10.1007/s00200-023-00606-6","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48208169","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学术官方微信