Two constructions of asymptotically optimal codebooks via the trace functions

DOI10.1007/s12095-020-00448-wzbMath1469.94174arXiv1905.01815OpenAlexW3042599303MaRDI QIDQ2040325

Xia Wu, Wei Lu, Xiwang Cao

Publication date: 13 July 2021

Published in: Cryptography and Communications (Search for Journal in Brave)

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

zbMATH Keywords

codebookasymptotic optimalitytrace functionWelch bound

Mathematics Subject Classification ID

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

Related Items (3)

Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) ⋮ Six constructions of asymptotically optimal codebooks via the character sums ⋮ Hybrid character sums and near-optimal partial Hadamard codebooks

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
• Six constructions of asymptotically optimal codebooks via the character sums
• 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
• Monomial and quadratic bent functions over the finite fields of odd characteristic
• 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: Two constructions of asymptotically optimal codebooks via the trace functions