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

DOI10.3934/AMC.2022091MaRDI QIDQ6584322zbMATH OpenFDO

Authors Wei Lu, Xia Wu, Xiwang Cao

Publication date 6 August 2024

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

Full work available at URL https://doi.org/10.3934/AMC.2022091

zbMATH Keywords

asymptotically optimalcodebookJacobi summultiplicative characterWelch bound

Mathematics Subject Classification ID

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

Recommendations

• Six constructions of asymptotically optimal codebooks via the character sums
• A further construction of asymptotically optimal codebooks with multiplicative characters
• Two constructions of asymptotically optimal codebooks via the trace functions
• Generalized asymptotically optimal codebooks
• Two constructions of asymptotically optimal codebooks according to the Welch bound

Cites work

• A Construction of Codebooks Associated With Binary Sequences
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Achieving the Welch Bound With Difference Sets
• An Introduction to Frames
• Complex Codebooks From Combinatorial Designs
• Construction of cyclotomic codebooks nearly meeting the Welch bound
• Equiangular Tight Frames From Hyperovals
• 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.)
• Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping
• Nearly optimal codebooks based on generalized Jacobi sums
• New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
• New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
• New nearly optimal codebooks from relative difference sets
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Six constructions of asymptotically optimal codebooks via the character sums
• Spherical codes and designs
• Steiner equiangular tight frames
• Symmetric informationally complete quantum measurements
• Tremain equiangular tight frames
• Two Classes of Codebooks Nearly Meeting the Welch Bound
• Two constructions of asymptotically optimal codebooks
• Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum
• Two constructions of asymptotically optimal codebooks via the trace functions
• Two families of nearly optimal codebooks

Cited in

(2)

• Hybrid character sums and near-optimal partial Hadamard codebooks
• The Jacobi sums over Galois rings of arbitrary characters and their applications in constructing asymptotically optimal codebooks

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)