Two constructions of asymptotically optimal codebooks according to the Welch bound

DOI10.1016/j.amc.2018.11.062zbMath1428.94113OpenAlexW2904902200WikidataQ128702842 ScholiaQ128702842MaRDI QIDQ2008811

You Gao, Min-Yao Niu

Publication date: 26 November 2019

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

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

zbMATH Keywords

projective spacevector spaceasymptotic optimalityWelch boundLevenshtein boundcodebooks

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Other types of codes (94B60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
• New nearly optimal codebooks from relative difference sets
• Steiner equiangular tight frames
• Construction of cyclotomic codebooks nearly meeting the Welch bound
• On the existence of equiangular tight frames
• Grassmannian frames with applications to coding and communication
• Equiangular Tight Frames From Hyperovals
• Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
• New Families of Codebooks Achieving the Levenstein Bound
• Grassmannian beamforming for multiple-input multiple-output wireless systems
• On beamforming with finite rate feedback in multiple-antenna systems
• 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
• Systematic design of unitary space-time constellations
• 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
• Two Classes of Codebooks Nearly Meeting the Welch Bound
• New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality