Two Classes of Codebooks Nearly Meeting the Welch Bound
From MaRDI portal
Publication:5272029
DOI10.1109/TIT.2011.2176531zbMath1365.94654OpenAlexW1971946972MaRDI QIDQ5272029
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2011.2176531
Related Items
Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\), Six constructions of asymptotically optimal codebooks via the character sums, 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, Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications, Cayley sum graphs and their applications to codebooks, A new class of near-optimal partial Fourier codebooks from an almost difference set, Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\), More constructions of near optimal codebooks associated with binary sequences, Two constructions of asymptotically optimal codebooks according to the Welch bound, Two classes of near-optimal codebooks with respect to the Welch bound, Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms, Two constructions of asymptotically optimal codebooks via the trace functions, Nearly optimal codebooks based on generalized Jacobi sums, Two constructions of asymptotically optimal codebooks, Two families of nearly optimal codebooks, New Constructions of Codebooks Nearly Meeting the Welch Bound
