Answers are grounded in this paper and cite their sources.
Codebooks achieving the Welch bound on the maximum correlationamplitude are desirable in a number of applications. Recently,codebooks meeting (resp., nearly meeting) the Welch bound wereconstructed from difference sets (resp., almost difference sets). Inthis paper, a general connection between complex codebooks andrelative difference sets is introduced. Several classes of codebooksnearly meeting the Welch bound are then constructed from some knownrelative difference sets using the general connection.
No takes yet. Share an insight, caveat, or question.
Zhou et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: