On the 2-adic complexity of cyclotomic binary sequences of order four

IF 0.6 4区工程技术 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-02-13 DOI:10.1007/s00200-023-00598-3

Fuqing Sun, Qin Yue, Xia Li

{"title":"On the 2-adic complexity of cyclotomic binary sequences of order four","authors":"Fuqing Sun, Qin Yue, Xia Li","doi":"10.1007/s00200-023-00598-3","DOIUrl":null,"url":null,"abstract":"<div>Let \\(p\\equiv 1\\pmod 4\\) be a prime. In this paper, we support a new method, i.e., a product of 2-adic values for four binary sequences, to determine the maximum evaluations of the 2-adic complexity in all almost balanced cyclotomic binary sequences of order four with period \\(N=p\\), which are viewed as generalizing the results in Hu (IEEE Trans. Inf. Theory 60:5803–5804, 2014) and Xiong et al. (IEEE Trans. Inf. Theory 60:2399–2406, 2014) without the autocorrelation values of cyclotomic binary sequences of order four with period p. By number theory we obtain two necessary and sufficient conditions about the 2-adic complexity of all balanced cyclotomic binary sequences of order four with period \\(N=2p\\) and show the 2-adic complexity of several non-balanced cyclotomic binary sequences of order four with period 2p, which are viewed as generalizing the results in Zhang et al. (IEEE Trans. Inf. Theory 66:4613–4620, 2020).</div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":"36 2","pages":"133 - 151"},"PeriodicalIF":0.6000,"publicationDate":"2023-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00200-023-00598-3.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Algebra in Engineering Communication and Computing","FirstCategoryId":"5","ListUrlMain":"https://link.springer.com/article/10.1007/s00200-023-00598-3","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

Abstract

Let \(p\equiv 1\pmod 4\) be a prime. In this paper, we support a new method, i.e., a product of 2-adic values for four binary sequences, to determine the maximum evaluations of the 2-adic complexity in all almost balanced cyclotomic binary sequences of order four with period \(N=p\), which are viewed as generalizing the results in Hu (IEEE Trans. Inf. Theory 60:5803–5804, 2014) and Xiong et al. (IEEE Trans. Inf. Theory 60:2399–2406, 2014) without the autocorrelation values of cyclotomic binary sequences of order four with period p. By number theory we obtain two necessary and sufficient conditions about the 2-adic complexity of all balanced cyclotomic binary sequences of order four with period \(N=2p\) and show the 2-adic complexity of several non-balanced cyclotomic binary sequences of order four with period 2p, which are viewed as generalizing the results in Zhang et al. (IEEE Trans. Inf. Theory 66:4613–4620, 2020).

查看原文本刊更多论文

关于四阶分圆二进制序列的2-dic复杂性

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Applicable Algebra in Engineering Communication and Computing 工程技术-计算机：跨学科应用

CiteScore

2.90

自引率

14.30%

发文量

审稿时长

>12 weeks

期刊介绍： Algebra is a common language for many scientific domains. In developing this language mathematicians prove theorems and design methods which demonstrate the applicability of algebra. Using this language scientists in many fields find algebra indispensable to create methods, techniques and tools to solve their specific problems. Applicable Algebra in Engineering, Communication and Computing will publish mathematically rigorous, original research papers reporting on algebraic methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Its scope includes, but is not limited to, vision, robotics, system design, fault tolerance and dependability of systems, VLSI technology, signal processing, signal theory, coding, error control techniques, cryptography, protocol specification, networks, software engineering, arithmetics, algorithms, complexity, computer algebra, programming languages, logic and functional programming, algebraic specification, term rewriting systems, theorem proving, graphics, modeling, knowledge engineering, expert systems, and artificial intelligence methodology. Purely theoretical papers will not primarily be sought, but papers dealing with problems in such domains as commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, which are of interest for applications in the above mentioned fields are relevant for this journal. On the practical side, technology and know-how transfer papers from engineering which either stimulate or illustrate research in applicable algebra are within the scope of the journal.