Pages that link to "Item:Q5272029"

The following pages link to Two Classes of Codebooks Nearly Meeting the Welch Bound (Q5272029):

Displayed 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)
• Nearly optimal codebooks based on generalized Jacobi sums (Q1801063) ‎ (← 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)
• Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms (Q2286597) ‎ (← 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)
• Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound (Q6047448) ‎ (← links)
• Hybrid character sums and near-optimal partial Hadamard codebooks (Q6052932) ‎ (← links)
• Character sums over a non-chain ring and their applications (Q6112242) ‎ (← links)