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 functionsNearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)Further study of planar functions in characteristic twoSeveral new classes of self-dual bent functions derived from involutionsSeveral classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weightsConstructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein boundHybrid character sums and near-optimal partial Hadamard codebooksCharacter sums over a non-chain ring and their applicationsSeveral classes of permutation polynomials based on the AGW criterion over the finite field \(\mathbb{F}_{2^{2m}}\)Properties of tight frames that are regular schemesCayley sum graphs and their applications to codebooksOn the search for tight frames of low coherenceOptimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)Two constructions of asymptotically optimal codebooks according to the Welch boundTwo classes of near-optimal codebooks with respect to the Welch boundA further construction of asymptotically optimal codebooks with multiplicative charactersCodebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic formsNearly optimal codebooks based on generalized Jacobi sumsNew Constructions of Codebooks Nearly Meeting the Welch Bound






This page was built for publication: New Families of Codebooks Achieving the Levenstein Bound