New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality

DOI10.1109/TIT.2013.2292745zbMath1364.94694OpenAlexW2045264273MaRDI QIDQ5346133

Jinsong Wu, Hong Gang Hu

Publication date: 8 June 2017

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

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

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

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 ⋮ 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 ⋮ Two constructions of asymptotically optimal codebooks according to the Welch bound ⋮ Two classes of near-optimal codebooks with respect to the Welch bound ⋮ Two constructions of asymptotically optimal codebooks via the trace functions ⋮ On explicit random-like tournaments ⋮ Nearly optimal codebooks based on generalized Jacobi sums ⋮ New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8 ⋮ Two constructions of asymptotically optimal codebooks ⋮ New Constructions of Codebooks Nearly Meeting the Welch Bound