Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields

DOI10.3934/AMC.2022091zbMATH Open1544.94302MaRDI QIDQ6584322

Xia Wu, Xiwang Cao, Wei Lu

Publication date: 6 August 2024

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

zbMATH Keywords

codebookasymptotically optimalJacobi sumWelch boundmultiplicative character

Mathematics Subject Classification ID

Bounds on codes (94B65) Other character sums and Gauss sums (11T24) Communication theory (94A05)

Cites Work

• Title not available (Why is that?)
• 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
• Six constructions of asymptotically optimal codebooks via the character sums
• Two constructions of asymptotically optimal codebooks
• 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

This page was built for publication: Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields

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