Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
From MaRDI portal
Publication:2977160
DOI10.1109/TIT.2015.2487451zbMath1359.94917OpenAlexW2108563407MaRDI QIDQ2977160
Can Xiang, Cunsheng Ding, Sihem Mesnager
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2015.2487451
Related Items
More permutations and involutions for constructing bent functions, Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\), 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, Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local 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, Complete weight enumerators of two classes of linear codes, 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, Combinatorial \(t\)-designs from special functions, Nearly optimal codebooks based on generalized Jacobi sums
