Complex Codebooks From Combinatorial Designs

DOI10.1109/TIT.2006.880058MaRDI QIDQ3547944zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Codebooks from almost difference sets
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• New nearly optimal codebooks from relative difference sets
• Constructions of some classes of codebooks nearly meeting the Welch bound
• Two families of nearly optimal codebooks

Cited in

(41)

• Codebooks from almost difference sets
• Achieving the Welch Bound With Difference Sets
• Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
• Optimal and perfect difference systems of sets
• Two families of nearly optimal codebooks
• Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
• Two constructions of asymptotically optimal codebooks according to the Welch bound
• Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields
• Gauss periods and codebooks from generalized cyclotomic sets of order four
• Constructions of some classes of codebooks nearly meeting the Welch bound
• Two classes of near-optimal codebooks with respect to the Welch bound
• New constructions of codebooks nearly meeting the Welch bound
• scientific article; zbMATH DE number 1740059 (Why is no real title available?)
• A new class of near-optimal partial Fourier codebooks from an almost difference set
• Unit time-phase signal sets with the explicit maximum cross ambiguity amplitudes
• Character sums over a non-chain ring and their applications
• Two constructions of asymptotically optimal codebooks
• Unit time-phase signal sets: bounds and constructions
• Hybrid character sums and near-optimal partial Hadamard codebooks
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Ideal access structures based on a class of minimal linear codes
• 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
• Constructions of divisible difference sets, almost difference sets and special partial direct product difference sets from binary sequences
• Nearly optimal codebooks based on generalized Jacobi sums
• Codes from difference sets
• Two new constructions of approximately SIC-POVMs from multiplicative characters
• Generalized asymptotically optimal codebooks
• scientific article; zbMATH DE number 826047 (Why is no real title available?)
• 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
• Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
• New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8
• Construction of cyclotomic codebooks nearly meeting the Welch bound
• Two classes of asymptotically optimal codebooks based on hybrid character sums
• Cayley sum graphs and their applications to codebooks
• More constructions of near optimal codebooks associated with binary sequences
• New nearly optimal codebooks from relative difference sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547944)