New nearly optimal codebooks from relative difference sets
Zhengchun Zhou, Xiaohu Tang · Advances in Mathematics of Communications · 2011
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.