{"title":"周期为2pn / GF(q)序列的k误差线性复杂度算法","authors":"Jianqin Zhou, Xirong Xu","doi":"10.1109/IWSDA.2007.4408335","DOIUrl":null,"url":null,"abstract":"We first optimize the structure of the Wei-Xiao-Chen algorithm for the linear complexity of sequences over GF(q) with period N = 2pn, where p and q are odd primes, and q is a primitive root ( mod p2). Then the union cost is used, so that an efficient algorithm for computing k-error linear complexity of a sequence with period 2pn over GF(q) is derived, where p and q are odd primes, and q is a primitive root of modulo p2. We also give a validity proof of the proposed algorithm. Finally, a numerical example is presented to illustrate the algorithm.","PeriodicalId":303512,"journal":{"name":"2007 3rd International Workshop on Signal Design and Its Applications in Communications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)\",\"authors\":\"Jianqin Zhou, Xirong Xu\",\"doi\":\"10.1109/IWSDA.2007.4408335\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We first optimize the structure of the Wei-Xiao-Chen algorithm for the linear complexity of sequences over GF(q) with period N = 2pn, where p and q are odd primes, and q is a primitive root ( mod p2). Then the union cost is used, so that an efficient algorithm for computing k-error linear complexity of a sequence with period 2pn over GF(q) is derived, where p and q are odd primes, and q is a primitive root of modulo p2. We also give a validity proof of the proposed algorithm. Finally, a numerical example is presented to illustrate the algorithm.\",\"PeriodicalId\":303512,\"journal\":{\"name\":\"2007 3rd International Workshop on Signal Design and Its Applications in Communications\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 3rd International Workshop on Signal Design and Its Applications in Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWSDA.2007.4408335\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 3rd International Workshop on Signal Design and Its Applications in Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSDA.2007.4408335","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)
We first optimize the structure of the Wei-Xiao-Chen algorithm for the linear complexity of sequences over GF(q) with period N = 2pn, where p and q are odd primes, and q is a primitive root ( mod p2). Then the union cost is used, so that an efficient algorithm for computing k-error linear complexity of a sequence with period 2pn over GF(q) is derived, where p and q are odd primes, and q is a primitive root of modulo p2. We also give a validity proof of the proposed algorithm. Finally, a numerical example is presented to illustrate the algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
