Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum

DOI10.1109/TIT.2017.2777492zbMath1401.94250OpenAlexW2768518515MaRDI QIDQ4682931

Xiwang Cao, Gaojun Luo

Publication date: 19 September 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.2777492

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Arithmetic codes (94B40)

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 ⋮ Estimations on some hybrid exponential sums related to Kloosterman 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 ⋮ 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 ⋮ 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

This page was built for publication: Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum