关于四阶四元环切序列的线性复杂性的注意事项

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

Information Processing Letters Pub Date : 2025-07-15 DOI:10.1016/j.ipl.2025.106595

Vladimir Edemskiy, Zeyu Cao

{"title":"关于四阶四元环切序列的线性复杂性的注意事项","authors":"Vladimir Edemskiy, Zeyu Cao","doi":"10.1016/j.ipl.2025.106595","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we study the linear complexity of quaternary cyclotomic sequences with period <em>p</em>, where <span><math><mi>p</mi><mo>></mo><mn>2</mn></math></span> is a prime. Considered sequences are based on classical cyclotomic classes of order four modulo <em>p</em>. We show that any balanced quaternary cyclotomic sequence of order four with period <em>p</em> has high linear complexity over finite ring of order four. Our results generalize those obtained earlier by other authors.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"191 ","pages":"Article 106595"},"PeriodicalIF":0.7000,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Notes about the linear complexity of quaternary cyclotomic sequences of order four\",\"authors\":\"Vladimir Edemskiy, Zeyu Cao\",\"doi\":\"10.1016/j.ipl.2025.106595\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this paper, we study the linear complexity of quaternary cyclotomic sequences with period <em>p</em>, where <span><math><mi>p</mi><mo>></mo><mn>2</mn></math></span> is a prime. Considered sequences are based on classical cyclotomic classes of order four modulo <em>p</em>. We show that any balanced quaternary cyclotomic sequence of order four with period <em>p</em> has high linear complexity over finite ring of order four. Our results generalize those obtained earlier by other authors.</div></div>\",\"PeriodicalId\":56290,\"journal\":{\"name\":\"Information Processing Letters\",\"volume\":\"191 \",\"pages\":\"Article 106595\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2025-07-15\",\"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/S0020019025000390\",\"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/S0020019025000390","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了周期为p的四元环切序列的线性复杂度，其中p>；2为素数。所考虑的序列是基于经典的四阶模p的环切序列。我们证明了任何周期为p的四阶平衡四阶环切序列在四阶有限环上具有很高的线性复杂度。我们的结果推广了先前其他作者的结果。

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

查看原文本刊更多论文

Notes about the linear complexity of quaternary cyclotomic sequences of order four

In this paper, we study the linear complexity of quaternary cyclotomic sequences with period p, where

p > 2

is a prime. Considered sequences are based on classical cyclotomic classes of order four modulo p. We show that any balanced quaternary cyclotomic sequence of order four with period p has high linear complexity over finite ring of order four. Our results generalize those obtained earlier by other authors.

求助全文

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

来源期刊

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.