ISCAS OpenIR
new nearly optimal codebooks from relative difference sets
Zhou Zhengchun; Tang Xiaohu
2011
SourceADVANCES IN MATHEMATICS OF COMMUNICATIONS
ISSN1930-5346
Volume5Issue:3Pages:521-527
English AbstractCodebooks 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.
Indexed TypeSCI
KeywordCodebooks Signal Sets Welch Bound Difference Sets Almost Difference Sets Relative Difference Sets
DepartmentZhou 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.
SubjectComputer Science ; Mathematics
SponsorshipNational Science Foundation of China (NSFC)60772086; Australia-China Special Fund61011120055; Fundemental Research Funds for the Central UniversitiesSWJTU09BR201, SWJTU09ZT37
Language英语
WOS IDWOS:000293643300008
Citation statistics
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/16081
Collection中国科学院软件研究所
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhou Zhengchun]'s Articles
[Tang Xiaohu]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhou Zhengchun]'s Articles
[Tang Xiaohu]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhou Zhengchun]'s Articles
[Tang Xiaohu]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.