Abstract
An (N, K) codebook C is a set of N unit-norm complex vectors in \BBCK. Optimal codebooks meeting the Welch bound with equality are desirable in a number of areas. However, it is very difficult to construct such optimal codebooks. There have been a number of attempts to construct codebooks nearly meeting the Welch bound with equality, i.e., the maximal cross-correlation amplitude Imax(C) is slightly higher than the Welch bound equality, but asymptotically achieves it for large enough N. In this paper, using difference sets and the product of Abelian groups, we propose new constructions of codebooks nearly meeting the Welch bound with equality. Our methods yield many codebooks with new parameters. In some cases, our constructions are comparable to known constructions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
