A further construction of asymptotically optimal codebooks with multiplicative characters

DOI10.1007/S00200-019-00387-XzbMath1457.94240OpenAlexW2947673833MaRDI QIDQ2280311

Can Xiang, Wenjuan Yin, Fang-Wei Fu

Publication date: 18 December 2019

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-019-00387-x

zbMATH Keywords

asymptotic optimalityWelch boundcodebooksgeneralized Jacobi sumsLevenstein bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other character sums and Gauss sums (11T24)

Related Items (1)

Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
• Steiner equiangular tight frames
• Grassmannian frames with applications to coding and communication
• Nearly optimal codebooks based on generalized Jacobi sums
• Tremain equiangular tight frames
• Equiangular Tight Frames From Hyperovals
• Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
• New Families of Codebooks Achieving the Levenstein Bound
• Achieving the Welch Bound With Difference Sets
• Complex Codebooks From Combinatorial Designs
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Z₄ -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
• New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
• Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• An introduction to frames and Riesz bases

This page was built for publication: A further construction of asymptotically optimal codebooks with multiplicative characters