素幂模广义多项式商二元阈值序列的线性复杂度

Int. J. Found. Comput. Sci. Pub Date : 2020-08-31 DOI:10.1142/s0129054120500264

Lianhua Wang, Xiaoni Du

{"title":"素幂模广义多项式商二元阈值序列的线性复杂度","authors":"Lianhua Wang, Xiaoni Du","doi":"10.1142/s0129054120500264","DOIUrl":null,"url":null,"abstract":"In this paper, firstly we extend the polynomial quotient modulo an odd prime p to its general case with modulo pr and r ≥ 1. From the new quotient proposed, we define a class of pr+1-periodic binar...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"11 8","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus\",\"authors\":\"Lianhua Wang, Xiaoni Du\",\"doi\":\"10.1142/s0129054120500264\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, firstly we extend the polynomial quotient modulo an odd prime p to its general case with modulo pr and r ≥ 1. From the new quotient proposed, we define a class of pr+1-periodic binar...\",\"PeriodicalId\":192109,\"journal\":{\"name\":\"Int. J. Found. Comput. Sci.\",\"volume\":\"11 8\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Found. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0129054120500264\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Found. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0129054120500264","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文首先将多项式商模奇素数p推广到模pr且r≥1的一般情况。根据所提出的新商，我们定义了一类pr+1周期的二元矩阵。

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

查看原文本刊更多论文

Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus

In this paper, firstly we extend the polynomial quotient modulo an odd prime p to its general case with modulo pr and r ≥ 1. From the new quotient proposed, we define a class of pr+1-periodic binar...

求助全文

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

来源期刊

Int. J. Found. Comput. Sci.

自引率

0.00%

发文量