Applicable Algebra in Engineering Communication and Computing最新文献

{"title":"More classes of optimal quinary cyclic codes of form $${mathcal {C}}_{(1,e,s)}$$","authors":"Y. Liu, X. Cao, Zhengbang Zha","doi":"10.1007/s00200-023-00604-8","DOIUrl":"https://doi.org/10.1007/s00200-023-00604-8","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":"45582324","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}

{"title":"A discrete SIS-model built on the strictly positive scheme","authors":"Marcin Choiński","doi":"10.1007/s00200-023-00607-5","DOIUrl":"10.1007/s00200-023-00607-5","url":null,"abstract":"<div><p>In this paper we introduce and analyze a discrete <i>SIS</i> epidemic model for a homogeneous population. As a discretization method the strictly positive scheme was chosen. The presented model is built from its continuous counterpart known from literature. We firstly present basic properties of the system. Later we discuss local stability of stationary states and global stability for the disease-free stationary state. The results for this state are expressed with the use of the basic reproduction number. The main conclusion from our work is that conditions for stability of the stationary states do not depend on the step size of the discretization method. This fact stays in contrary to other discrete models analyzed in our previous papers. Theoretical results are accomplished with numerical simulations.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00200-023-00607-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45166937","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}

{"title":"Fourteen years of cube attacks","authors":"Marco Cianfriglia, Elia Onofri, Silvia Onofri, M. Pedicini","doi":"10.1007/s00200-023-00602-w","DOIUrl":"https://doi.org/10.1007/s00200-023-00602-w","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45636548","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}

{"title":"Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes","authors":"Boran Kim","doi":"10.1007/s00200-023-00605-7","DOIUrl":"10.1007/s00200-023-00605-7","url":null,"abstract":"<div><p>There are various metrics for researching error-correcting codes. Especially, high-density data storage system gives the existence of inconsistency for the reading and writing process. The symbol-pair metric is motivated for outputs that have overlapping pairs of symbols in a certain channel. The Rosenbloom–Tsfasman (RT) metric is introduced since there exists a problem that is related to transmission over several parallel communication channels with some channels not available for the transmission. In this paper, we determine the minimum symbol-pair weight and RT weight of repeated-root cyclic codes over <span>(mathfrak R=mathbb {F}_{p^m}[u]/langle u^4rangle )</span> of length <span>(n=p^k)</span>. For the determination, we explicitly present third torsional degree for all different types of cyclic codes over <span>(mathfrak R)</span> of length <i>n</i>.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42822754","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}

{"title":"Computing the (forcing) strong metric dimension in strongly annihilating-ideal graphs","authors":"M. Pazoki, R. Nikandish","doi":"10.1007/s00200-023-00601-x","DOIUrl":"https://doi.org/10.1007/s00200-023-00601-x","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42668152","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}

{"title":"Algebraic and SAT models for SCA generation","authors":"Marlene Koelbing, Bernhard Garn, Enrico Iurlano, I. Kotsireas, D. Simos","doi":"10.1007/s00200-023-00597-4","DOIUrl":"https://doi.org/10.1007/s00200-023-00597-4","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48363389","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}

{"title":"x-superoptimal pairings on elliptic curves with odd prime embedding degrees: BW13-P310 and BW19-P286","authors":"Emmanuel Fouotsa, Laurian Azebaze Guimagang, Raoul Ayissi","doi":"10.1007/s00200-023-00596-5","DOIUrl":"https://doi.org/10.1007/s00200-023-00596-5","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48519380","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}

{"title":"On the 2-adic complexity of cyclotomic binary sequences of order four","authors":"Fuqing Sun, Q. Yue, Xia Li","doi":"10.1007/s00200-023-00598-3","DOIUrl":"https://doi.org/10.1007/s00200-023-00598-3","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49026945","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}

{"title":"Two dimensional double cyclic codes over finite fields","authors":"Niloufar Hajiaghajanpour, K. Khashyarmanesh","doi":"10.1007/s00200-023-00595-6","DOIUrl":"https://doi.org/10.1007/s00200-023-00595-6","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49092840","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}

{"title":"Algorithmic counting of nonequivalent compact Huffman codes","authors":"Christian Elsholtz,&nbsp;Clemens Heuberger,&nbsp;Daniel Krenn","doi":"10.1007/s00200-022-00593-0","DOIUrl":"10.1007/s00200-022-00593-0","url":null,"abstract":"<div><p>It is known that the following five counting problems lead to the same integer sequence <span>({f_t}({n}))</span>: </p><ol>\u0000 <li>\u0000 <span>(1)</span>\u0000 \u0000 <p>the number of nonequivalent compact Huffman codes of length <i>n</i> over an alphabet of <i>t</i> letters,</p>\u0000 \u0000 </li>\u0000 <li>\u0000 <span>(2)</span>\u0000 \u0000 <p>the number of “nonequivalent” complete rooted <i>t</i>-ary trees (level-greedy trees) with <i>n</i> leaves,</p>\u0000 \u0000 </li>\u0000 <li>\u0000 <span>(3)</span>\u0000 \u0000 <p>the number of “proper” words (in the sense of Even and Lempel),</p>\u0000 \u0000 </li>\u0000 <li>\u0000 <span>(4)</span>\u0000 \u0000 <p>the number of bounded degree sequences (in the sense of Komlós, Moser, and Nemetz), and</p>\u0000 \u0000 </li>\u0000 <li>\u0000 <span>(5)</span>\u0000 \u0000 <p>the number of ways of writing </p><div><div><span>$$begin{aligned} 1= frac{1}{t^{x_1}}+ dots + frac{1}{t^{x_n}} end{aligned}$$</span></div></div><p> with integers <span>(0 le x_1 le x_2 le dots le x_n)</span>.</p>\u0000 \u0000 </li>\u0000 </ol><p>In this work, we show that one can compute this sequence for <b>all</b> <span>(n&lt;N)</span> with essentially one power series division. In total we need at most <span>(N^{1+varepsilon })</span> additions and multiplications of integers of <i>cN</i> bits (for a positive constant <span>(c&lt;1)</span> depending on <i>t</i> only) or <span>(N^{2+varepsilon })</span> bit operations, respectively, for any <span>(varepsilon &gt;0)</span>. This improves an earlier bound by Even and Lempel who needed <span>({O}({{N^3}}))</span> operations in the integer ring or <span>(O({N^4}))</span> bit operations, respectively.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00200-022-00593-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47254023","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}