Pages that link to "Item:Q644327"
From MaRDI portal
The following pages link to New nearly optimal codebooks from relative difference sets (Q644327):
Displaying 23 items.
- More constructions of near optimal codebooks associated with binary sequences (Q514537) (← links)
- Construction of cyclotomic codebooks nearly meeting the Welch bound (Q766244) (← links)
- Codebooks from almost difference sets (Q1008969) (← links)
- Nearly optimal codebooks based on generalized Jacobi sums (Q1801063) (← links)
- Two constructions of asymptotically optimal codebooks according to the Welch bound (Q2008811) (← links)
- Two classes of near-optimal codebooks with respect to the Welch bound (Q2025366) (← links)
- Two constructions of asymptotically optimal codebooks via the trace functions (Q2040325) (← links)
- Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) (Q2158234) (← links)
- Generalized asymptotically optimal codebooks (Q2180662) (← links)
- Six constructions of asymptotically optimal codebooks via the character sums (Q2182078) (← links)
- Three deterministic constructions of compressed sensing matrices with low coherence (Q2202898) (← links)
- Two constructions of asymptotically optimal codebooks (Q2311434) (← links)
- Two families of nearly optimal codebooks (Q2339131) (← links)
- A new class of near-optimal partial Fourier codebooks from an almost difference set (Q2448090) (← links)
- Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications (Q2689915) (← links)
- Cayley sum graphs and their applications to codebooks (Q2697479) (← links)
- The performance of difference coding for sets and relational tables (Q3452506) (← links)
- Achieving the Welch Bound With Difference Sets (Q3547813) (← links)
- Constructions of some classes of codebooks nearly meeting the Welch bound (Q5382439) (← links)
- New Constructions of Codebooks Nearly Meeting the Welch Bound (Q5859651) (← links)
- Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound (Q6047448) (← links)
- Character sums over a non-chain ring and their applications (Q6112242) (← links)
- Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields (Q6584322) (← links)
