Generalized asymptotically optimal codebooks

DOI10.1016/J.AMC.2020.125230MaRDI QIDQ2180662zbMATH OpenOpenAlexFDO

Authors Gang Wang, Min-Yao Niu, You Gao

Publication date 14 May 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2020.125230

zbMATH Keywords

asymptotic optimalitycharacter sumscodebooksfinite fieldsmaximal cross-correlation amplitudeWelch bound

Mathematics Subject Classification ID

Other character sums and Gauss sums (11T24) Cyclic codes (94B15) Bounds on codes (94B65)

Recommendations

• Two constructions of asymptotically optimal codebooks according to the Welch bound
• Six constructions of asymptotically optimal codebooks via the character sums
• Two constructions of asymptotically optimal codebooks via the trace functions
• Two constructions of asymptotically optimal codebooks
• Two families of nearly optimal codebooks

Cites work

• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Achieving the Welch Bound With Difference Sets
• Complex Codebooks From Combinatorial Designs
• Deterministic Sensing Matrices Arising From Near Orthogonal Systems
• Equiangular Tight Frames From Hyperovals
• Grassmannian beamforming for multiple-input multiple-output wireless systems
• Grassmannian frames with applications to coding and communication
• scientific article; zbMATH DE number 1740059 (Why is no real title available?)
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Nearly optimal codebooks based on generalized Jacobi sums
• New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
• New nearly optimal codebooks from relative difference sets
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Spherical codes and designs
• Steiner equiangular tight frames
• Two constructions of asymptotically optimal codebooks
• Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum
• Two families of nearly optimal codebooks

Cited in

(13)

• Two constructions of asymptotically optimal codebooks according to the Welch bound
• Two constructions of asymptotically optimal codebooks via the trace functions
• Six constructions of asymptotically optimal codebooks via the character sums
• A further construction of asymptotically optimal codebooks with multiplicative characters
• New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8
• Two constructions of asymptotically optimal codebooks
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Flexible Codebook Design for Limited Feedback Systems Via Sequential Smooth Optimization on the Grassmannian Manifold
• Asymptotic optimality of the GMD and Chase decoding algorithms
• Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
• More constructions of near optimal codebooks associated with binary sequences
• Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
• Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields

This page was built for publication: Generalized asymptotically optimal codebooks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180662)