new nearly optimal codebooks from relative difference sets

ISCAS OpenIR

	new nearly optimal codebooks from relative difference sets
	Zhou Zhengchun; Tang Xiaohu
	2011
发表期刊	ADVANCES IN MATHEMATICS OF COMMUNICATIONS
ISSN	1930-5346
卷号	5 期号:3 页码:521-527
摘要	Codebooks achieving the Welch bound on the maximum correlation amplitude are desirable in a number of applications. Recently, codebooks meeting (resp., nearly meeting) the Welch bound were constructed from difference sets (resp., almost difference sets). In this paper, a general connection between complex codebooks and relative difference sets is introduced. Several classes of codebooks nearly meeting the Welch bound are then constructed from some known relative difference sets using the general connection.; Codebooks achieving the Welch bound on the maximum correlation amplitude are desirable in a number of applications. Recently, codebooks meeting (resp., nearly meeting) the Welch bound were constructed from difference sets (resp., almost difference sets). In this paper, a general connection between complex codebooks and relative difference sets is introduced. Several classes of codebooks nearly meeting the Welch bound are then constructed from some known relative difference sets using the general connection.
收录类别	SCI
关键词	Codebooks Signal Sets Welch Bound Difference Sets Almost Difference Sets Relative Difference Sets
部门归属	Zhou Zhengchun SW Jiaotong Univ Sch Math Chengdu 610031 Peoples R China. Tang Xiaohu SW Jiaotong Univ Provincial Key Lab Informat Coding & Transmiss Chengdu 610031 Peoples R China. Zhou Zhengchun Chinese Acad Sci State Key Lab Informat Secur Inst Software Beijing Peoples R China.
学科领域	Computer Science ; Mathematics
资助者	National Science Foundation of China (NSFC)60772086; Australia-China Special Fund61011120055; Fundemental Research Funds for the Central UniversitiesSWJTU09BR201, SWJTU09ZT37
语种	英语
WOS记录号	WOS:000293643300008
引用统计
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16081
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Zhou Zhengchun,Tang Xiaohu. new nearly optimal codebooks from relative difference sets[J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS,2011,5(3):521-527.
APA	Zhou Zhengchun,&Tang Xiaohu.(2011).new nearly optimal codebooks from relative difference sets.ADVANCES IN MATHEMATICS OF COMMUNICATIONS,5(3),521-527.
MLA	Zhou Zhengchun,et al."new nearly optimal codebooks from relative difference sets".ADVANCES IN MATHEMATICS OF COMMUNICATIONS 5.3(2011):521-527.