New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters

DOI10.1109/TIT.2017.2693204zbMath1390.94877OpenAlexW2605907766MaRDI QIDQ4566480

Qin Yue, Cunsheng Ding, Ziling Heng

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2017.2693204

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (15)

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 ⋮ 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 ⋮ Construction of \(\varepsilon_d\)-ASIC-POVMs via 2-to-1 PN functions and the Li bound ⋮ Cayley sum graphs and their applications to codebooks ⋮ Two constructions of asymptotically optimal codebooks according to the Welch bound ⋮ A further construction of asymptotically optimal codebooks with multiplicative characters ⋮ Two constructions of asymptotically optimal codebooks via the trace functions ⋮ Nearly optimal codebooks based on generalized Jacobi sums ⋮ Two constructions of asymptotically optimal codebooks ⋮ New Constructions of Codebooks Nearly Meeting the Welch Bound

This page was built for publication: New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters