A Generic Construction of Complex Codebooks Meeting the Welch Bound
From MaRDI portal
Publication:3549043
DOI10.1109/TIT.2007.907343zbMath1237.94002OpenAlexW2110673833MaRDI QIDQ3549043
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
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Communication theory (94A05)
Related Items (51)
Gauss periods and codebooks from generalized cyclotomic sets of order four ⋮ Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) ⋮ Equiangular tight frames that contain regular simplices ⋮ Unit time-phase signal sets: bounds and constructions ⋮ Hadamard equiangular tight frames ⋮ Frames over finite fields: basic theory and equiangular lines in unitary geometry ⋮ Generalized asymptotically optimal codebooks ⋮ Six constructions of asymptotically optimal codebooks via the character sums ⋮ Toward the classification of biangular harmonic frames ⋮ 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 ⋮ Equiangular tight frames from group divisible designs ⋮ Equiangular tight frames with centroidal symmetry ⋮ Welch bound equality sets with few distinct inner products from Delsarte-Goethals sets ⋮ Character sums over a non-chain ring and their applications ⋮ Optimal arrangements of classical and quantum states with limited purity ⋮ Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications ⋮ Constructions and restrictions for balanced splittable Hadamard matrices ⋮ Properties of tight frames that are regular schemes ⋮ Three deterministic constructions of compressed sensing matrices with low coherence ⋮ Cayley sum graphs and their applications to codebooks ⋮ A new class of near-optimal partial Fourier codebooks from an almost difference set ⋮ Grassmannian codes from paired difference sets ⋮ Doubly transitive lines. I: Higman pairs and roux ⋮ Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\) ⋮ Optimal line packings from nonabelian groups ⋮ New constructions of approximately SIC-POVMs via difference sets ⋮ More constructions of near optimal codebooks associated with binary sequences ⋮ Geometry of the Welch bounds ⋮ Unit time-phase signal sets with the explicit maximum cross ambiguity amplitudes ⋮ 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 ⋮ A further construction of asymptotically optimal codebooks with multiplicative characters ⋮ Packings in Real Projective Spaces ⋮ Harmonic equiangular tight frames comprised of regular simplices ⋮ Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms ⋮ New Upper Bounds for Equiangular Lines by Pillar Decomposition ⋮ Two constructions of asymptotically optimal codebooks via the trace functions ⋮ Nearly optimal codebooks based on generalized Jacobi sums ⋮ OPTIMAL LINE PACKINGS FROM FINITE GROUP ACTIONS ⋮ Codebooks from almost difference sets ⋮ Welch bound-achieving compressed sensing matrices from optimal codebooks ⋮ New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8 ⋮ Equiangular tight frames and unistochastic matrices ⋮ Two constructions of asymptotically optimal codebooks ⋮ Construction of cyclotomic codebooks nearly meeting the Welch bound ⋮ Polyphase equiangular tight frames and abelian generalized quadrangles ⋮ Two families of nearly optimal codebooks ⋮ New Constructions of Codebooks Nearly Meeting the Welch Bound
This page was built for publication: A Generic Construction of Complex Codebooks Meeting the Welch Bound
