Two Classes of Codebooks Nearly Meeting the Welch Bound
From MaRDI portal
Cited in
(22)- Nearly optimal codebooks based on generalized Jacobi sums
- Two constructions of asymptotically optimal codebooks according to the Welch bound
- Two classes of near-optimal codebooks with respect to the Welch bound
- Two constructions of asymptotically optimal codebooks via the trace functions
- Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
- Six constructions of asymptotically optimal codebooks via the character sums
- Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
- Two constructions of asymptotically optimal codebooks
- Two families of nearly optimal codebooks
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications
- Cayley sum graphs and their applications to codebooks
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
- More constructions of near optimal codebooks associated with binary sequences
- New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
- New constructions of codebooks nearly meeting the Welch bound
- Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
- Hybrid character sums and near-optimal partial Hadamard codebooks
- Character sums over a non-chain ring and their applications
- Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields
- Two classes of asymptotically optimal codebooks based on hybrid character sums
This page was built for publication: Two Classes of Codebooks Nearly Meeting the Welch Bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272029)
