m - y Sidel'nikov序列F/ p/上的线性复杂度

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI:10.1109/ISIT.2005.1523697

Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung

{"title":"m - y Sidel'nikov序列F/ p/上的线性复杂度","authors":"Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung","doi":"10.1109/ISIT.2005.1523697","DOIUrl":null,"url":null,"abstract":"In this paper, we derive linear complexity over Fp of the M-ary Sidel'nikov sequences using discrete Fourier transform. As an example, we represent the linear complexity of the ternary Sidel'nikov sequences. It turned out that the ternary Sidel'nikov sequences have the linear complexity nearly close to their periods","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"On the linear complexity over F/sub p/ of M-ary Sidel'nikov sequences\",\"authors\":\"Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung\",\"doi\":\"10.1109/ISIT.2005.1523697\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we derive linear complexity over Fp of the M-ary Sidel'nikov sequences using discrete Fourier transform. As an example, we represent the linear complexity of the ternary Sidel'nikov sequences. It turned out that the ternary Sidel'nikov sequences have the linear complexity nearly close to their periods\",\"PeriodicalId\":166130,\"journal\":{\"name\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2005.1523697\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523697","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

本文利用离散傅里叶变换，导出了m - y Sidel'nikov序列在Fp上的线性复杂度。作为一个例子，我们表示了三元Sidel'nikov序列的线性复杂度。结果表明，三元Sidel'nikov序列具有接近其周期的线性复杂度

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On the linear complexity over F/sub p/ of M-ary Sidel'nikov sequences

In this paper, we derive linear complexity over Fp of the M-ary Sidel'nikov sequences using discrete Fourier transform. As an example, we represent the linear complexity of the ternary Sidel'nikov sequences. It turned out that the ternary Sidel'nikov sequences have the linear complexity nearly close to their periods

求助全文

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

来源期刊

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

自引率

0.00%

发文量

期刊最新文献

Upper bounds on the rate of LDPC codes as a function of minimum distance A wireless network can achieve maximum throughput without each node meeting all others Optimal linear decentralized estimation in a bandwidth constrained sensor network Near BER optimal partial response codes Bounds on mutual information rates of noisy channels with timing errors