New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
From MaRDI portal
Cited in
(20)- Nearly optimal codebooks based on generalized Jacobi sums
- Two constructions of asymptotically optimal codebooks according 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\)
- Generalized asymptotically optimal codebooks
- Six constructions of asymptotically optimal codebooks via the character sums
- A further construction of asymptotically optimal codebooks with multiplicative characters
- Two constructions of asymptotically 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
- 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
- Construction of _d-ASIC-POVMs via 2-to-1 PN functions and the Li bound
- Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields
- Two classes of asymptotically optimal codebooks based on hybrid character sums
- New ternary self-orthogonal codes and related LCD codes from weakly regular plateaued functions
This page was built for publication: New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566480)
