{"title":"时钟控制FCSR序列的分布性质和二进复杂度","authors":"Lishan Ke, Zhiqiang Lin","doi":"10.1109/3PGCIC.2014.134","DOIUrl":null,"url":null,"abstract":"In this paper, the stop-and-go clock-controlled generator based on feedback with carry shift register (FCSR) is considered. The elementary statistical properties of its sequences are investigated. We prove that some d-decimation sequences are of ideal arithmetic correlation under certain conditions. Moreover, the upper and lower bounds of the 2-adic complexity of an output sequence are obtained when the control register sequence and the generating register sequence are both l-sequences.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distribution Properties and 2-Adic Complexity of Clock-Controlled FCSR Sequences\",\"authors\":\"Lishan Ke, Zhiqiang Lin\",\"doi\":\"10.1109/3PGCIC.2014.134\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the stop-and-go clock-controlled generator based on feedback with carry shift register (FCSR) is considered. The elementary statistical properties of its sequences are investigated. We prove that some d-decimation sequences are of ideal arithmetic correlation under certain conditions. Moreover, the upper and lower bounds of the 2-adic complexity of an output sequence are obtained when the control register sequence and the generating register sequence are both l-sequences.\",\"PeriodicalId\":395610,\"journal\":{\"name\":\"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/3PGCIC.2014.134\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/3PGCIC.2014.134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distribution Properties and 2-Adic Complexity of Clock-Controlled FCSR Sequences
In this paper, the stop-and-go clock-controlled generator based on feedback with carry shift register (FCSR) is considered. The elementary statistical properties of its sequences are investigated. We prove that some d-decimation sequences are of ideal arithmetic correlation under certain conditions. Moreover, the upper and lower bounds of the 2-adic complexity of an output sequence are obtained when the control register sequence and the generating register sequence are both l-sequences.