New Families of Codebooks Achieving the Levenstein Bound
From MaRDI portal
Publication:2983380
DOI10.1109/TIT.2014.2353052zbMath1360.94397MaRDI QIDQ2983380
Cunsheng Ding, Nian Li, Zhengchun Zhou
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (19)
More permutations and involutions for constructing bent functions ⋮ Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) ⋮ Further study of planar functions in characteristic two ⋮ Several new classes of self-dual bent functions derived from involutions ⋮ Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights ⋮ 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 ⋮ Several classes of permutation polynomials based on the AGW criterion over the finite field \(\mathbb{F}_{2^{2m}}\) ⋮ Properties of tight frames that are regular schemes ⋮ Cayley sum graphs and their applications to codebooks ⋮ On the search for tight frames of low coherence ⋮ Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\) ⋮ Two constructions of asymptotically optimal codebooks according to the Welch bound ⋮ Two classes of near-optimal codebooks with respect to the Welch bound ⋮ A further construction of asymptotically optimal codebooks with multiplicative characters ⋮ Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms ⋮ Nearly optimal codebooks based on generalized Jacobi sums ⋮ New Constructions of Codebooks Nearly Meeting the Welch Bound
This page was built for publication: New Families of Codebooks Achieving the Levenstein Bound
