{"title":"p -周期序列的1误差线性复杂度的性质","authors":"Ming Su, Lusheng Chen","doi":"10.1109/ISIT.2006.261899","DOIUrl":null,"url":null,"abstract":"Some properties of p<sup>n</sup>-periodic sequences over F<sub>p </sub> with fixed linear complexity value are found. Based on this, the distribution of the 1-error linear complexity of p<sup>n</sup>-periodic sequences over F<sub>p</sub> is provided. The expectation of the 1-error linear complexity of random p<sup>n</sup>-periodic sequences over F<sub>p</sub> is calculated and its estimated range is given. According to these results, an efficient algorithm for computing the 1-error linear complexity of a p<sup>n</sup>-periodic sequence, as well as a new algorithm for determining all the error vectors that give the 1-error linear complexity, is proposed","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"The Properties of the 1-error Linear Complexity of pn-periodic Sequences Over Fp\",\"authors\":\"Ming Su, Lusheng Chen\",\"doi\":\"10.1109/ISIT.2006.261899\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Some properties of p<sup>n</sup>-periodic sequences over F<sub>p </sub> with fixed linear complexity value are found. Based on this, the distribution of the 1-error linear complexity of p<sup>n</sup>-periodic sequences over F<sub>p</sub> is provided. The expectation of the 1-error linear complexity of random p<sup>n</sup>-periodic sequences over F<sub>p</sub> is calculated and its estimated range is given. According to these results, an efficient algorithm for computing the 1-error linear complexity of a p<sup>n</sup>-periodic sequence, as well as a new algorithm for determining all the error vectors that give the 1-error linear complexity, is proposed\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.261899\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.261899","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Properties of the 1-error Linear Complexity of pn-periodic Sequences Over Fp
Some properties of pn-periodic sequences over Fp with fixed linear complexity value are found. Based on this, the distribution of the 1-error linear complexity of pn-periodic sequences over Fp is provided. The expectation of the 1-error linear complexity of random pn-periodic sequences over Fp is calculated and its estimated range is given. According to these results, an efficient algorithm for computing the 1-error linear complexity of a pn-periodic sequence, as well as a new algorithm for determining all the error vectors that give the 1-error linear complexity, is proposed