Pages that link to "Item:Q2182078"

The following pages link to Six constructions of asymptotically optimal codebooks via the character sums (Q2182078):

Displaying 11 items.

• 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)
• Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) (Q2158234) (← links)
• Generalized asymptotically optimal codebooks (Q2180662) (← links)
• A further construction of asymptotically optimal codebooks with multiplicative characters (Q2280311) (← links)
• Two constructions of asymptotically optimal codebooks (Q2311434) (← links)
• Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications (Q2689915) (← links)
• Cayley sum graphs and their applications to codebooks (Q2697479) (← links)
• Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound (Q6047448) (← links)
• Character sums over a non-chain ring and their applications (Q6112242) (← links)
• Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields (Q6584322) (← links)