2 problems

Let $\mathbb{S}^{d-1}$ be the unit sphere, and consider codebooks consisting of points on this sphere. A simplex codebook is a maximally separated codebook; the paper also consider…

Let $U^M=(U_1,\ldots,U_M)$ be a rotationally symmetric codebook, and let $k$-closest encoding denote the proposed encoding scheme that selects the $k$ closest codewords to the inpu…