从字符乘积中派生出具有良好相关性的大型代码序列集

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI:10.1109/ISIT.1994.394734

H. Schotten, G. Berg

{"title":"从字符乘积中派生出具有良好相关性的大型代码序列集","authors":"H. Schotten, G. Berg","doi":"10.1109/ISIT.1994.394734","DOIUrl":null,"url":null,"abstract":"In this paper we investigate large families of polyphase sequences which can be expressed as product of an additive and a multiplicative character. The construction of a family with size M=N(N+2) and maximum magnitude of the periodic correlation function /spl theta/~/sub max//spl les/2/spl radic/N+1 is described.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Large sets of code-sequences with good correlation properties derived from character products\",\"authors\":\"H. Schotten, G. Berg\",\"doi\":\"10.1109/ISIT.1994.394734\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we investigate large families of polyphase sequences which can be expressed as product of an additive and a multiplicative character. The construction of a family with size M=N(N+2) and maximum magnitude of the periodic correlation function /spl theta/~/sub max//spl les/2/spl radic/N+1 is described.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1994.394734\",\"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 of 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.394734","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文研究了可表示为加性和乘性之积的大族多相序列。描述了周期相关函数/spl theta/~/sub max//spl les/2/spl radic/N+1的最大大小M=N(N+2)族的构造

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

查看原文本刊更多论文

Large sets of code-sequences with good correlation properties derived from character products

In this paper we investigate large families of polyphase sequences which can be expressed as product of an additive and a multiplicative character. The construction of a family with size M=N(N+2) and maximum magnitude of the periodic correlation function /spl theta/~/sub max//spl les/2/spl radic/N+1 is described.<>

求助全文

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

来源期刊

Proceedings of 1994 IEEE International Symposium on Information Theory

自引率

0.00%

发文量