{"title":"周期为pn / GF(q)序列线性复杂度的一种快速算法","authors":"G. Xiao, Shimin Wei, Kwok-Yan Lam, K. Imamura","doi":"10.1109/18.868492","DOIUrl":null,"url":null,"abstract":"A fast algorithm is presented for determining the linear complexity of a sequence with period p/sup n/ over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p/sup 2/).","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"24 1","pages":"2203-2206"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"66","resultStr":"{\"title\":\"A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)\",\"authors\":\"G. Xiao, Shimin Wei, Kwok-Yan Lam, K. Imamura\",\"doi\":\"10.1109/18.868492\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A fast algorithm is presented for determining the linear complexity of a sequence with period p/sup n/ over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p/sup 2/).\",\"PeriodicalId\":13250,\"journal\":{\"name\":\"IEEE Trans. Inf. Theory\",\"volume\":\"24 1\",\"pages\":\"2203-2206\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"66\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Trans. Inf. Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/18.868492\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Trans. Inf. Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/18.868492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)
A fast algorithm is presented for determining the linear complexity of a sequence with period p/sup n/ over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p/sup 2/).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
