New Constructions of Codebooks Nearly Meeting the Welch Bound
From MaRDI portal
Publication:5859651
DOI10.1142/S012905412050032XzbMath1462.94068OpenAlexW3110106201MaRDI QIDQ5859651
Zexia Shi, Lei Sun, Fang-Wei Fu
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905412050032x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bent and generalized bent Boolean functions
- 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
- Codebooks from almost difference sets
- Spherical codes and designs
- Grassmannian frames with applications to coding and communication
- Nearly optimal codebooks based on generalized Jacobi sums
- Partial spread and vectorial generalized bent functions
- Tremain equiangular tight frames
- Equiangular Tight Frames From Hyperovals
- New Families of Codebooks Achieving the Levenstein Bound
- 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
- Further Results on Generalized Bent Functions and Their Complete Characterization
- Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Symmetric informationally complete quantum measurements
- Generalized Bent Functions and Their Gray Images
- Two Classes of Codebooks Nearly Meeting the Welch Bound
- New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
- Complete Characterization of Generalized Bent and 2k-Bent Boolean Functions
- An introduction to frames and Riesz bases
This page was built for publication: New Constructions of Codebooks Nearly Meeting the Welch Bound
