A Generic Construction of Complex Codebooks Meeting the Welch Bound
From MaRDI portal
Publication:3549043
Recommendations
- Constructions of some classes of codebooks nearly meeting the Welch bound
- New constructions of codebooks nearly meeting the Welch bound
- Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
- Two constructions of asymptotically optimal codebooks according to the Welch bound
- New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
- Construction of cyclotomic codebooks nearly meeting the Welch bound
- Two Classes of Codebooks Nearly Meeting the Welch Bound
- Two classes of near-optimal codebooks with respect to the Welch bound
- Generalized asymptotically optimal codebooks
- Complex Codebooks From Combinatorial Designs
Cited in
(63)- Codebooks from almost difference sets
- Equiangular tight frames that contain regular simplices
- Equiangular tight frames with centroidal symmetry
- New constructions of approximately SIC-POVMs via difference sets
- Geometry of the Welch bounds
- Nearly optimal codebooks based on generalized Jacobi sums
- Optimal line packings from nonabelian groups
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Two constructions of asymptotically optimal codebooks according to the Welch bound
- Two classes of near-optimal codebooks with respect to the Welch bound
- Two constructions of asymptotically optimal codebooks via the trace functions
- Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
- Generalized asymptotically optimal codebooks
- Six constructions of asymptotically optimal codebooks via the character sums
- Properties of tight frames that are regular schemes
- Three deterministic constructions of compressed sensing matrices with low coherence
- Grassmannian codes from paired difference sets
- Doubly transitive lines. I: Higman pairs and roux
- Unit time-phase signal sets with the explicit maximum cross ambiguity amplitudes
- A further construction of asymptotically optimal codebooks with multiplicative characters
- Harmonic equiangular tight frames comprised of regular simplices
- Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
- New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8
- Two constructions of asymptotically optimal codebooks
- Polyphase equiangular tight frames and abelian generalized quadrangles
- Two families of nearly optimal codebooks
- Gauss periods and codebooks from generalized cyclotomic sets of order four
- Unit time-phase signal sets: bounds and constructions
- Toward the classification of biangular harmonic frames
- Equiangular tight frames from group divisible designs
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- Hadamard equiangular tight frames
- Frames over finite fields: basic theory and equiangular lines in unitary geometry
- Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications
- Constructions and restrictions for balanced splittable Hadamard matrices
- Cayley sum graphs and their applications to codebooks
- Achieving the Welch Bound With Difference Sets
- Complex Codebooks From Combinatorial Designs
- scientific article; zbMATH DE number 1740059 (Why is no real title available?)
- Packings in real projective spaces
- Welch bound-achieving compressed sensing matrices from optimal codebooks
- Equiangular tight frames and unistochastic matrices
- Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
- Optimal arrangements of classical and quantum states with limited purity
- More constructions of near optimal codebooks associated with binary sequences
- New upper bounds for equiangular lines by pillar decomposition
- OPTIMAL LINE PACKINGS FROM FINITE GROUP ACTIONS
- New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
- New constructions of codebooks nearly meeting the Welch bound
- Harmonic Grassmannian codes
- Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
- Hybrid character sums and near-optimal partial Hadamard codebooks
- Welch bound equality sets with few distinct inner products from Delsarte-Goethals sets
- Character sums over a non-chain ring and their applications
- New nearly optimal codebooks from relative difference sets
- Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields
- Linear codes with few weights over finite fields
- Naimark-spatial families of equichordal tight fusion frames
- On the optimal arrangement of \(2d\) lines in \(\mathbb{C}^d\)
- Two classes of asymptotically optimal codebooks based on hybrid character sums
- Doubly transitive equiangular tight frames that contain regular simplices
- On the codebook design for NOMA schemes from bent functions
- Construction of cyclotomic codebooks nearly meeting the Welch bound
This page was built for publication: A Generic Construction of Complex Codebooks Meeting the Welch Bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549043)
