Complex Codebooks From Combinatorial Designs

DOI10.1109/TIT.2006.880058zbMath1237.94001OpenAlexW2169607109MaRDI QIDQ3547944

Cunsheng Ding

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

Mathematics Subject Classification ID

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

Related Items (31)

Gauss periods and codebooks from generalized cyclotomic sets of order four ⋮ Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) ⋮ Unit time-phase signal sets: bounds and constructions ⋮ Generalized asymptotically optimal codebooks ⋮ Six constructions of asymptotically optimal codebooks via the character sums ⋮ Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound ⋮ Hybrid character sums and near-optimal partial Hadamard codebooks ⋮ Character sums over a non-chain ring and their applications ⋮ Optimal arrangements of classical and quantum states with limited purity ⋮ Ideal access structures based on a class of minimal linear codes ⋮ Two new constructions of approximately SIC-POVMs from multiplicative characters ⋮ Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications ⋮ Cayley sum graphs and their applications to codebooks ⋮ A new class of near-optimal partial Fourier codebooks from an almost difference set ⋮ Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\) ⋮ More constructions of near optimal codebooks associated with binary sequences ⋮ 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 ⋮ Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms ⋮ Optimal and perfect difference systems of sets ⋮ Two constructions of asymptotically optimal codebooks via the trace functions ⋮ Nearly optimal codebooks based on generalized Jacobi sums ⋮ Codebooks from almost difference sets ⋮ New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8 ⋮ Two constructions of asymptotically optimal codebooks ⋮ Construction of cyclotomic codebooks nearly meeting the Welch bound ⋮ Two families of nearly optimal codebooks ⋮ New Constructions of Codebooks Nearly Meeting the Welch Bound

This page was built for publication: Complex Codebooks From Combinatorial Designs