Answers are grounded in this paper and cite their sources.
In this paper, a new class of (N, K) near-optimal partial Hadamard codebooks is proposed. The construction of the proposed codebooks from Hadamard matrices is based on binary row selection sequences, which are generated by quadratic have parameters N = pnand K = (p - 1/2 p)(N + √N) + 1 for an odd prime p and an even positive integer n. We prove that the maximum magnitude of inner products between the code vectors of the proposed codebooks asymptotically achieves the Welch bound equality for sufficiently large p and derive their inner product distribution.
No takes yet. Share an insight, caveat, or question.
Hong et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: