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

Applicable Algebra in Engineering Communication and Computing最新文献

筛选
英文 中文
DNA codes over $$GR(2^{3},d)[X]/langle X^{2},2X rangle$$ 在 $$GR(2^{3},d)[X]/langle X^{2},2X rangle$$ 上的 DNA 编码
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2024-07-13 DOI: 10.1007/s00200-024-00667-1
C. Álvarez-García, C. A. Castillo-Guillén, Mohamed Badaoui
{"title":"DNA codes over $$GR(2^{3},d)[X]/langle X^{2},2X rangle$$","authors":"C. Álvarez-García, C. A. Castillo-Guillén, Mohamed Badaoui","doi":"10.1007/s00200-024-00667-1","DOIUrl":"https://doi.org/10.1007/s00200-024-00667-1","url":null,"abstract":"<p>The main results of this paper are in two directions. First, the family of finite local rings of length 4 whose annihilator of their maximal ideals have length 2 is determined. Second, the structure of constacyclic, reversible and DNA codes over those rings are described, the length of the code is relatively prime to the characteristic of the residue field of the ring.</p>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141610391","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 reversible DNA codes over the ring $${mathbb {Z}}_4[u,v]/langle u^2-2,uv-2,v^2,2u,2vrangle$$ based on the deletion distance 基于删除距离的环 $${mathbb {Z}}_4[u,v]/angle u^2-2,uv-2,v^2,2u,2vrangle$$ 上的可逆 DNA 编码
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2024-07-09 DOI: 10.1007/s00200-024-00661-7
Hai Q. Dinh, Mohammad Ashraf, Washiqur Rehman, Ghulam Mohammad, Mohd Asim
{"title":"On reversible DNA codes over the ring $${mathbb {Z}}_4[u,v]/langle u^2-2,uv-2,v^2,2u,2vrangle$$ based on the deletion distance","authors":"Hai Q. Dinh, Mohammad Ashraf, Washiqur Rehman, Ghulam Mohammad, Mohd Asim","doi":"10.1007/s00200-024-00661-7","DOIUrl":"https://doi.org/10.1007/s00200-024-00661-7","url":null,"abstract":"<p>Let <span>({mathfrak {R}}= {mathbb {Z}}_4[u,v]/langle u^2-2,uv-2,v^2,2u,2vrangle)</span> be a ring, where <span>({mathbb {Z}}_{4})</span> is a ring of integers modulo 4. This ring <span>({mathfrak {R}})</span> is a local non-chain ring of characteristic 4. The main objective of this article is to construct reversible cyclic codes of odd length <i>n</i> over the ring <span>({mathfrak {R}}.)</span> Employing these reversible cyclic codes, we obtain reversible cyclic DNA codes of length <i>n</i>, based on the deletion distance over the ring <span>({mathfrak {R}}.)</span> We also construct a bijection <span>(Gamma)</span> between the elements of the ring <span>({mathfrak {R}})</span> and <span>(S_{D_{16}}.)</span> As an application of <span>(Gamma ,)</span> the reversibility problem which occurs in DNA <i>k</i>-bases has been solved. Moreover, we introduce a Gray map <span>(Psi _{hom }:{mathfrak {R}}^{n}rightarrow {mathbb {F}}_{2}^{8n})</span> with respect to homogeneous weight <span>(w_{hom })</span> over the ring <span>({mathfrak {R}})</span>. Further, we discuss the <i>GC</i>-content of DNA cyclic codes and their deletion distance. Moreover, we provide some examples of reversible DNA cyclic codes.</p>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141568631","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
Algebraic lattices coming from $${mathbb {Z}}$$ -modules generalizing ramified prime ideals in odd prime degree cyclic number fields 来自奇素数域中{${mathbb {Z}}$ -模块泛化夯素理想的代数网格
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2024-07-08 DOI: 10.1007/s00200-024-00666-2
Antonio Aparecido de Andrade, Robson Ricardo de Araujo, Trajano Pires da Nobrega Neto, Jefferson Luiz Rocha Bastos
{"title":"Algebraic lattices coming from $${mathbb {Z}}$$ -modules generalizing ramified prime ideals in odd prime degree cyclic number fields","authors":"Antonio Aparecido de Andrade, Robson Ricardo de Araujo, Trajano Pires da Nobrega Neto, Jefferson Luiz Rocha Bastos","doi":"10.1007/s00200-024-00666-2","DOIUrl":"https://doi.org/10.1007/s00200-024-00666-2","url":null,"abstract":"<p>Lattice theory has shown to be useful in information theory, and rotated lattices with high modulation diversity have been extensively studied as an alternative approach for transmission over a Rayleigh fading channel, where the performance depends on the minimum product distance to achieve coding gains. The maximum diversity of a rotated lattice is guaranteed when we use totally real number fields and the minimum product distance is optimized by considering fields with minimum discriminants. With the construction of full-diversity algebraic lattices as our goal, in this work we present and study constructions of full-diversity algebraic lattices in odd prime dimensional Euclidean spaces from families of modules in cyclic number fields. These families include all the ramified prime ideals in each of these number fields. As immediate applications of our results, we present algebraic constructions from the densest lattices in dimensions 3 and 5.</p>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141568628","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
Constacyclic codes over $${{mathbb {Z}}_2[u]}/{langle u^2rangle }times {{mathbb {Z}}_2[u]}/{langle u^3rangle }$$ and the MacWilliams identities 关于 $${{{mathbb {Z}}_2[u]}/{{langle u^2rangle }/{{{mathbb {Z}}_2[u]}/{{langle u^3rangle }$$ 和麦克威廉斯等式的恒环码
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2024-07-04 DOI: 10.1007/s00200-024-00662-6
Vidya Sagar, Ankit Yadav, Ritumoni Sarma
{"title":"Constacyclic codes over $${{mathbb {Z}}_2[u]}/{langle u^2rangle }times {{mathbb {Z}}_2[u]}/{langle u^3rangle }$$ and the MacWilliams identities","authors":"Vidya Sagar, Ankit Yadav, Ritumoni Sarma","doi":"10.1007/s00200-024-00662-6","DOIUrl":"https://doi.org/10.1007/s00200-024-00662-6","url":null,"abstract":"<p>In this article, we deal with additive codes over the Frobenius ring <span>({mathcal {R}}_{2}{mathcal {R}}_{3}:=frac{{mathbb {Z}}_{2}[u]}{langle u^2 rangle }times frac{{mathbb {Z}}_{2}[u]}{langle u^3 rangle })</span>. First, we study constacyclic codes over <span>({mathcal {R}}_2)</span> and <span>({mathcal {R}}_3)</span> and find their generator polynomials. With the help of these generator polynomials, we determine the structure of constacyclic codes over <span>({mathcal {R}}_2{mathcal {R}}_3)</span>. We use Gray maps to show that constacyclic codes over <span>({mathcal {R}}_{2}{mathcal {R}}_{3})</span> are essentially binary generalized quasi-cyclic codes. Moreover, we obtain a number of binary codes with good parameters from these <span>({mathcal {R}}_{2}{mathcal {R}}_{3})</span>-constacyclic codes. Besides, several weight enumerators are computed, and the corresponding MacWilliams identities are established.</p>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141551866","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
Stable coherent systems 稳定的连贯系统
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2024-07-02 DOI: 10.1007/s00200-024-00665-3
Rodrigo Iglesias, Fatemeh Mohammadi, Patricia Pascual-Ortigosa, Eduardo Sáenz-de-Cabezón, Henry P. Wynn
{"title":"Stable coherent systems","authors":"Rodrigo Iglesias, Fatemeh Mohammadi, Patricia Pascual-Ortigosa, Eduardo Sáenz-de-Cabezón, Henry P. Wynn","doi":"10.1007/s00200-024-00665-3","DOIUrl":"https://doi.org/10.1007/s00200-024-00665-3","url":null,"abstract":"<p>We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of stable systems can be efficiently computed using the algebraic versions of improved inclusion-exclusion formulas and sum of disjoint products.</p>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141523776","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 additive codes with one-rank hulls 关于具有一阶船体的加码
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2024-06-24 DOI: 10.1007/s00200-024-00663-5
S. T. Dougherty, Serap Şahinkaya, Deniz Ustun
{"title":"On additive codes with one-rank hulls","authors":"S. T. Dougherty, Serap Şahinkaya, Deniz Ustun","doi":"10.1007/s00200-024-00663-5","DOIUrl":"https://doi.org/10.1007/s00200-024-00663-5","url":null,"abstract":"<p>We study additive codes with 1-rank hulls and examine their properties for various dualities of the finite field of order 4. We give several constructions of additive and linear codes with 1-rank hulls. We also relate these codes to additive complementary dual codes (ACD). We give an interesting non-existence result for additive codes with a 1-rank hull for the duality <span>(M_2)</span> in terms of the parity of the number of generators. We conclude by giving substantive computations finding codes with one-rank hulls for small lengths using our results.</p>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141500936","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
Doubly even self-orthogonal codes from quasi-symmetric designs 来自准对称设计的双偶数自正交码
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2024-06-24 DOI: 10.1007/s00200-024-00664-4
Dean Crnković, Doris Dumičić Danilović, Ana Šumberac, Andrea Švob
{"title":"Doubly even self-orthogonal codes from quasi-symmetric designs","authors":"Dean Crnković, Doris Dumičić Danilović, Ana Šumberac, Andrea Švob","doi":"10.1007/s00200-024-00664-4","DOIUrl":"https://doi.org/10.1007/s00200-024-00664-4","url":null,"abstract":"<p>In this paper, we give a construction of doubly even self-orthogonal codes from quasi-symmetric designs. Especially, we study orbit matrices of quasi-symmetric designs and give a construction of doubly even self-orthogonal codes from orbit matrices of quasi-symmetric designs of Blokhuis–Haemers type.</p>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141500938","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
Geometry of the minimum distance 最小距离的几何形状
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2024-06-07 DOI: 10.1007/s00200-024-00659-1
John Pawlina, Ştefan O. Tohǎneanu
{"title":"Geometry of the minimum distance","authors":"John Pawlina, Ştefan O. Tohǎneanu","doi":"10.1007/s00200-024-00659-1","DOIUrl":"https://doi.org/10.1007/s00200-024-00659-1","url":null,"abstract":"<p>Let <span>({{mathbb {K}}})</span> be any field, let <span>(Xsubset {mathbb P}^{k-1})</span> be a set of <span>(n)</span> distinct <span>({{mathbb {K}}})</span>-rational points, and let <span>(age 1)</span> be an integer. In this paper we find lower bounds for the minimum distance <span>(d(X)_a)</span> of the evaluation code of order <span>(a)</span> associated to <span>(X)</span>. The first results use <span>(alpha (X))</span>, the initial degree of the defining ideal of <span>(X)</span>, and the bounds are true for any set <span>(X)</span>. In another result we use <span>(s(X))</span>, the minimum socle degree, to find a lower bound for the case when <span>(X)</span> is in general linear position. In both situations we improve and generalize known results.</p>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141551790","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
Some results on the Hamming distances of cyclic codes 关于循环码汉明距离的一些结果
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2024-05-30 DOI: 10.1007/s00200-024-00660-8
Guantao Pan, Lanqiang Li, Ziwen Cao, Fuyin Tian
{"title":"Some results on the Hamming distances of cyclic codes","authors":"Guantao Pan, Lanqiang Li, Ziwen Cao, Fuyin Tian","doi":"10.1007/s00200-024-00660-8","DOIUrl":"https://doi.org/10.1007/s00200-024-00660-8","url":null,"abstract":"<p>Cyclic codes over finite fields have been studied for decades due to their wide applicability in communication systems, consumer electronics, and data storage systems. Let <i>p</i> be an odd prime and let <i>s</i> and <i>m</i> be positive integers. In this paper, we first determine the Hamming distances of all cyclic codes of length 8 over <span>(F_q)</span>. Building upon this, we explicitly obtain the Hamming distances of all repeated-root cyclic codes of length <span>(8p^s)</span> over <span>(F_q)</span>. As an application, we give all maximum distance separable cyclic codes of length <span>(8p^s)</span>.</p>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141196315","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
New results of sparse permutation polynomials with trace functions over $$mathbb {F}_{q^n}$$ 在 $$mathbb {F}_{q^n}$ 上具有迹函数的稀疏置换多项式的新结果
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2024-05-13 DOI: 10.1007/s00200-024-00658-2
Yan-Ping Wang, Zhengbang Zha
{"title":"New results of sparse permutation polynomials with trace functions over $$mathbb {F}_{q^n}$$","authors":"Yan-Ping Wang, Zhengbang Zha","doi":"10.1007/s00200-024-00658-2","DOIUrl":"https://doi.org/10.1007/s00200-024-00658-2","url":null,"abstract":"<p>Permutation polynomials with sparse forms over finite fields attract researchers’ great interest and have important applications in many areas of mathematics and engineering. In this paper, by investigating the exponents (<i>s</i>, <i>i</i>) and the coefficients <span>(a,bin mathbb {F}_{q}^{*})</span>, we present some new results of permutation polynomials of the form <span>(f(x)= ax^{q^i(q^{2}-q+1)} + bx^{s} + textrm{Tr}_{q^n/q}(x))</span> over <span>(mathbb {F}_{q^n})</span> (<span>(n=2)</span> or 3). The permutation property of the new results is given by studying the number of solutions of special equations over <span>(mathbb {F}_{q^n})</span>.</p>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140926985","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学术官方微信