New constructions of codebooks nearly meeting the welch bound with equality

Article

Abstract: An (N, K) codebook C is a set of N unit-norm complex vectors in ℂk. Optimal codebooks meeting the We

Palabras claves:

CHARACTER, difference set, Grassmannian line packing, MWBE codebook, Welch bound

Autores:

Hu H., Jinsong Wu

Fuentes:

scopus