Pages that link to "Item:Q766244"

The following pages link to Construction of cyclotomic codebooks nearly meeting the Welch bound (Q766244):

Displaying 18 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 classes of near-optimal codebooks with respect to the Welch bound (Q2025366) (← 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)
• Six constructions of asymptotically optimal codebooks via the character sums (Q2182078) (← links)
• Unit time-phase signal sets with the explicit maximum cross ambiguity amplitudes (Q2254536) (← links)
• Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms (Q2286597) (← links)
• New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8 (Q2298923) (← links)
• Two constructions of asymptotically optimal codebooks (Q2311434) (← links)
• Two families of nearly optimal codebooks (Q2339131) (← links)
• A new class of near-optimal partial Fourier codebooks from an almost difference set (Q2448090) (← 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)
• New Constructions of Codebooks Nearly Meeting the Welch Bound (Q5859651) (← links)
• Hybrid character sums and near-optimal partial Hadamard codebooks (Q6052932) (← links)
• Character sums over a non-chain ring and their applications (Q6112242) (← links)