Achieving the Welch Bound With Difference Sets

DOI10.1109/TIT.2005.846411zbMath1237.94007OpenAlexW2121743251WikidataQ56565335 ScholiaQ56565335MaRDI QIDQ3547813

Shengli Zhou, Pengfei Xia, Georgios B. Giannakis

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.2005.846411

Mathematics Subject Classification ID

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

Related Items

Equiangular quantum key distribution in more than two dimensions ⋮ Phase retrieval from Gabor measurements ⋮ Properties of real and complex ETFs and their application to the design of low coherence frames ⋮ An estimator for the diagonal of a matrix ⋮ Achieving the orthoplex bound and constructing weighted complex projective 2-designs with Singer sets ⋮ 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 ⋮ Complex equiangular cyclic frames and erasures ⋮ Hadamard equiangular tight frames ⋮ Optimal linear transmission by loss-insensitive packet encoding ⋮ 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 ⋮ Equiangular tight frames ⋮ 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 ⋮ Full spark frames ⋮ 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 ⋮ Optimal arrangements of classical and quantum states with limited purity ⋮ DCACO: an algorithm for designing incoherent redundant matrices ⋮ Two are better than one: fundamental parameters of frame coherence ⋮ 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 ⋮ Maximal orthoplectic fusion frames from mutually unbiased bases and block designs ⋮ Numerically erasure-robust frames ⋮ Unnamed Item ⋮ Prime tight frames ⋮ A new class of near-optimal partial Fourier codebooks from an almost difference set ⋮ Low coherence unit norm tight frames ⋮ The road to deterministic matrices with the restricted isometry property ⋮ Steiner equiangular tight frames ⋮ 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 ⋮ More constructions of near optimal codebooks associated with binary sequences ⋮ Frames as Codes ⋮ Geometry of the Welch bounds ⋮ Two constructions of asymptotically optimal codebooks according to the Welch bound ⋮ Construction of highly redundant incoherent unit norm tight frames as a union of orthonormal bases ⋮ Two classes of near-optimal codebooks with respect to the Welch bound ⋮ Constructions of biangular tight frames and their relationships with equiangular tight frames ⋮ A further construction of asymptotically optimal codebooks with multiplicative characters ⋮ Packings in Real Projective Spaces ⋮ Harmonic equiangular tight frames comprised of regular simplices ⋮ Constructing subspace packings from other packings ⋮ On the existence of equiangular tight frames ⋮ Compressive sensing based sampling and reconstruction for wireless sensor array network ⋮ 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 ⋮ Equiangular lines, mutually unbiased bases, and spin models ⋮ Codebooks from almost difference sets ⋮ Two constructions of asymptotically optimal codebooks ⋮ Regular two-distance sets ⋮ Polyphase equiangular tight frames and abelian generalized quadrangles ⋮ The road to equal-norm Parseval frames ⋮ Unnamed Item ⋮ Two families of nearly optimal codebooks ⋮ New Constructions of Codebooks Nearly Meeting the Welch Bound ⋮ A Notion of Optimal Packings of Subspaces with Mixed-Rank and Solutions ⋮ Equiangular Frames and Their Duals ⋮ Group-theoretic constructions of erasure-robust frames ⋮ Signal recovery and frames that are robust to erasure

This page was built for publication: Achieving the Welch Bound With Difference Sets