A Generic Construction of Complex Codebooks Meeting the Welch Bound

DOI10.1109/TIT.2007.907343zbMATH Open1237.94002OpenAlexW2110673833MaRDI QIDQ3549043FDOQ3549043

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2007.907343

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

Mathematics Subject Classification ID

Communication theory (94A05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Cited In (59)

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

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)