Pages that link to "Item:Q2180662"

The following pages link to Generalized asymptotically optimal codebooks (Q2180662):

Displaying 10 items.

• Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\) (Q502403) (← links)
• More constructions of near optimal codebooks associated with binary sequences (Q514537) (← links)
• Two constructions of asymptotically optimal codebooks according to the Welch bound (Q2008811) (← links)
• Two constructions of asymptotically optimal codebooks via the trace functions (Q2040325) (← links)
• Six constructions of asymptotically optimal codebooks via the character sums (Q2182078) (← links)
• A further construction of asymptotically optimal codebooks with multiplicative characters (Q2280311) (← links)
• Two constructions of asymptotically optimal codebooks (Q2311434) (← links)
• A Generic Construction of Complex Codebooks Meeting the Welch Bound (Q3549043) (← links)
• Flexible Codebook Design for Limited Feedback Systems Via Sequential Smooth Optimization on the Grassmannian Manifold (Q4579052) (← links)
• Asymptotic optimality of the GMD and Chase decoding algorithms (Q4677560) (← links)