GF(Q)上不可约多项式的线性递归序列的生成

[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems Pub Date : 1991-05-14 DOI:10.1109/MWSCAS.1991.252049

M. S. Lam

{"title":"GF(Q)上不可约多项式的线性递归序列的生成","authors":"M. S. Lam","doi":"10.1109/MWSCAS.1991.252049","DOIUrl":null,"url":null,"abstract":"Linear recursive sequences generated from irreducible polynomials over GF(q), q=P/sup m/, a prime power, are investigated. These sequences are expressed as vector linear recursive sequences whose component sequences may be obtained directly from an irreducible polynomial over GF(p). The relationship between these components is investigated. A method of generating the primitive and nonprimitive irreducible polynomials is also discussed.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"7 14 1","pages":"261-264 vol.1"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generation of linear recursive sequences from irreducible polynomials over GF(Q)\",\"authors\":\"M. S. Lam\",\"doi\":\"10.1109/MWSCAS.1991.252049\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Linear recursive sequences generated from irreducible polynomials over GF(q), q=P/sup m/, a prime power, are investigated. These sequences are expressed as vector linear recursive sequences whose component sequences may be obtained directly from an irreducible polynomial over GF(p). The relationship between these components is investigated. A method of generating the primitive and nonprimitive irreducible polynomials is also discussed.<<ETX>>\",\"PeriodicalId\":6453,\"journal\":{\"name\":\"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems\",\"volume\":\"7 14 1\",\"pages\":\"261-264 vol.1\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MWSCAS.1991.252049\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.1991.252049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

研究了GF(q)上不可约多项式生成的线性递归序列，q=P/sup m/是素数幂。这些序列被表示为向量线性递归序列，其组成序列可以直接由GF(p)上的不可约多项式得到。研究了这些成分之间的关系。本文还讨论了原始和非原始不可约多项式的生成方法。

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

查看原文本刊更多论文

Generation of linear recursive sequences from irreducible polynomials over GF(Q)

Linear recursive sequences generated from irreducible polynomials over GF(q), q=P/sup m/, a prime power, are investigated. These sequences are expressed as vector linear recursive sequences whose component sequences may be obtained directly from an irreducible polynomial over GF(p). The relationship between these components is investigated. A method of generating the primitive and nonprimitive irreducible polynomials is also discussed.<>

求助全文

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

来源期刊

[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems

自引率

0.00%

发文量