Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
From MaRDI portal
Publication:6047448
DOI10.3934/amc.2021065MaRDI QIDQ6047448
Dengming Xu, Gang Wang, Fang-Wei Fu
Publication date: 12 September 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Hadamard matricescirculant matricescross correlationoptimal codesWelch boundFourier matricesLevenshtein boundcode constructions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic convolutional compressed sensing matrices
- 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
- Spherical codes and designs
- Grassmannian frames with applications to coding and communication
- Six constructions of asymptotically optimal codebooks via the character sums
- Two constructions of asymptotically optimal codebooks
- Two families of nearly optimal codebooks
- Equiangular Tight Frames From Hyperovals
- Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
- Compressed Sensing Matrices From Fourier Matrices
- New Families of Codebooks Achieving the Levenstein Bound
- Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping
- Deterministic Sensing Matrices Arising From Near Orthogonal Systems
- A Construction of Codebooks Associated With Binary Sequences
- Grassmannian beamforming for multiple-input multiple-output wireless systems
- Achieving the Welch Bound With Difference Sets
- Complex Codebooks From Combinatorial Designs
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- An Estimate for Character Sums
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
- Existence and construction of noncoherent unitary space-time codes
- Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Two Classes of Codebooks Nearly Meeting the Welch Bound
- New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
- On Exponential Sums in Finite Fields
- Polyphase codes with good periodic correlation properties (Corresp.)
This page was built for publication: Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
