一类长度为 pq 的高复杂度四元序列的自相关性

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2024-03-24 DOI:10.1016/j.ipl.2024.106494

Feifei Yan , Pinhui Ke , Zuling Chang

{"title":"一类长度为 pq 的高复杂度四元序列的自相关性","authors":"Feifei Yan , Pinhui Ke , Zuling Chang","doi":"10.1016/j.ipl.2024.106494","DOIUrl":null,"url":null,"abstract":"<div><p>Recently, a class of quaternary sequences with period <em>pq</em>, where <em>p</em> and <em>q</em> are two distinct odd primes introduced by Zhang et al. were proved to possess high linear complexity and 4-adic complexity. In this paper, we determine the autocorrelation distribution of this class of quaternary sequence. Our results indicate that the studied quaternary sequence are weak with respect to the correlation property.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106494"},"PeriodicalIF":0.7000,"publicationDate":"2024-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The autocorrelation of a class of quaternary sequences of length pq with high complexity\",\"authors\":\"Feifei Yan , Pinhui Ke , Zuling Chang\",\"doi\":\"10.1016/j.ipl.2024.106494\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Recently, a class of quaternary sequences with period <em>pq</em>, where <em>p</em> and <em>q</em> are two distinct odd primes introduced by Zhang et al. were proved to possess high linear complexity and 4-adic complexity. In this paper, we determine the autocorrelation distribution of this class of quaternary sequence. Our results indicate that the studied quaternary sequence are weak with respect to the correlation property.</p></div>\",\"PeriodicalId\":56290,\"journal\":{\"name\":\"Information Processing Letters\",\"volume\":\"186 \",\"pages\":\"Article 106494\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020019024000243\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019024000243","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

最近，Zhang 等人提出的一类周期为 pq（其中 p 和 q 是两个不同的奇数素数）的四元数列被证明具有很高的线性复杂度和四元数列复杂度。本文测定了该类四元序列的自相关分布。我们的结果表明，所研究的四元数列的相关性较弱。

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

查看原文本刊更多论文

The autocorrelation of a class of quaternary sequences of length pq with high complexity

Recently, a class of quaternary sequences with period pq, where p and q are two distinct odd primes introduced by Zhang et al. were proved to possess high linear complexity and 4-adic complexity. In this paper, we determine the autocorrelation distribution of this class of quaternary sequence. Our results indicate that the studied quaternary sequence are weak with respect to the correlation property.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.