最大线性复杂度周期序列与m -序列

[Proceedings] Singapore ICCS/ISITA `92 Pub Date : 1992-11-16 DOI:10.1109/ICCS.1992.255067

K. Imamura, Guo-Zhen Xiao

{"title":"最大线性复杂度周期序列与m -序列","authors":"K. Imamura, Guo-Zhen Xiao","doi":"10.1109/ICCS.1992.255067","DOIUrl":null,"url":null,"abstract":"This paper gives another proof of a maximum linear complexity property of the periodic sequences over GF(q) of period T=q/sup m/-1 obtained by the minimum changes of an m-sequence, and shows that the converse is also true if the period T=q/sup m/-1 is a prime number.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On periodic sequences of the maximum linear complexity and M-sequences\",\"authors\":\"K. Imamura, Guo-Zhen Xiao\",\"doi\":\"10.1109/ICCS.1992.255067\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper gives another proof of a maximum linear complexity property of the periodic sequences over GF(q) of period T=q/sup m/-1 obtained by the minimum changes of an m-sequence, and shows that the converse is also true if the period T=q/sup m/-1 is a prime number.<<ETX>>\",\"PeriodicalId\":223769,\"journal\":{\"name\":\"[Proceedings] Singapore ICCS/ISITA `92\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] Singapore ICCS/ISITA `92\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.1992.255067\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] Singapore ICCS/ISITA `92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.1992.255067","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文利用m序列的最小变化，给出了GF(q)上周期为T=q/sup m/-1的周期序列的最大线性复杂度性质的另一个证明，并证明了周期为T=q/sup m/-1的周期为素数时，反之也成立。

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

查看原文本刊更多论文

On periodic sequences of the maximum linear complexity and M-sequences

This paper gives another proof of a maximum linear complexity property of the periodic sequences over GF(q) of period T=q/sup m/-1 obtained by the minimum changes of an m-sequence, and shows that the converse is also true if the period T=q/sup m/-1 is a prime number.<>

求助全文

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

来源期刊

[Proceedings] Singapore ICCS/ISITA `92

自引率

0.00%

发文量