Six constructions of asymptotically optimal codebooks via the character sums

DOI10.1007/s10623-020-00735-wzbMath1442.94001arXiv1911.00506OpenAlexW3005571933MaRDI QIDQ2182078

Xiwang Cao, Ming Chen, Xia Wu, Wei Lu

Publication date: 21 May 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.00506

zbMATH Keywords

codebookGauss sumasymptotic optimalityJacobi sumWelch bound

Mathematics Subject Classification ID

Other character sums and Gauss sums (11T24) Communication theory (94A05)

Related Items

Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) ⋮ 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 via the trace functions

Cites Work

• Unnamed Item
• Unnamed Item
• New nearly optimal codebooks from relative difference sets
• Steiner equiangular tight frames
• Construction of cyclotomic codebooks nearly meeting the Welch bound
• Spherical codes and designs
• Grassmannian frames with applications to coding and communication
• Nearly optimal codebooks based on generalized Jacobi sums
• Two constructions of asymptotically optimal codebooks via the trace functions
• Two families of nearly optimal codebooks
• Tremain equiangular tight frames
• Equiangular Tight Frames From Hyperovals
• Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping
• A Construction of Codebooks Associated With Binary Sequences
• An Introduction to Frames
• 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.)
• 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
• Symmetric informationally complete quantum measurements
• Two Classes of Codebooks Nearly Meeting the Welch Bound
• New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality