Complex Codebooks From Combinatorial Designs
From MaRDI portal
Recommendations
Cited in
(42)- Optimal and perfect difference systems of sets
- Codebooks from almost difference sets
- Two new constructions of approximately SIC-POVMs from multiplicative characters
- Nearly optimal codebooks based on generalized Jacobi sums
- 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
- Two constructions of asymptotically optimal codebooks via the trace functions
- Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
- Generalized asymptotically optimal codebooks
- Six constructions of asymptotically optimal codebooks via the character sums
- Unit time-phase signal sets with the explicit maximum cross ambiguity amplitudes
- A further construction of asymptotically optimal codebooks with multiplicative characters
- Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
- New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8
- Two constructions of asymptotically optimal codebooks
- Two families of nearly optimal codebooks
- Gauss periods and codebooks from generalized cyclotomic sets of order four
- Unit time-phase signal sets: bounds and constructions
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications
- Cayley sum graphs and their applications to codebooks
- Ideal access structures based on a class of minimal linear codes
- Codes from difference sets
- Achieving the Welch Bound With Difference Sets
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Well-structured FHMA codebooks: a geometric approach
- scientific article; zbMATH DE number 1740059 (Why is no real title available?)
- scientific article; zbMATH DE number 826047 (Why is no real title available?)
- Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
- Optimal arrangements of classical and quantum states with limited purity
- More constructions of near optimal codebooks associated with binary sequences
- 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
- Hybrid character sums and near-optimal partial Hadamard codebooks
- Character sums over a non-chain ring and their applications
- New nearly optimal codebooks from relative difference sets
- Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields
- Two classes of asymptotically optimal codebooks based on hybrid character sums
- Constructions of divisible difference sets, almost difference sets and special partial direct product difference sets from binary sequences
- Construction of cyclotomic codebooks nearly meeting the Welch bound
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)
