Pages that link to "Item:Q5382439"

The following pages link to Constructions of some classes of codebooks nearly meeting the Welch bound (Q5382439):

Displaying 11 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)
• New nearly optimal codebooks from relative difference sets (Q644327) (← links)
• Construction of cyclotomic codebooks nearly meeting the Welch bound (Q766244) (← links)
• Codebooks from almost difference sets (Q1008969) (← links)
• Nearly optimal codebooks based on generalized Jacobi sums (Q1801063) (← links)
• Two classes of near-optimal codebooks with respect to the Welch bound (Q2025366) (← links)
• A further construction of asymptotically optimal codebooks with multiplicative characters (Q2280311) (← links)
• Two families of nearly optimal codebooks (Q2339131) (← links)
• A Generic Construction of Complex Codebooks Meeting the Welch Bound (Q3549043) (← links)
• New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality (Q5346133) (← links)