Pages that link to "Item:Q2986450"
From MaRDI portal
The following pages link to Deterministic Sensing Matrices Arising From Near Orthogonal Systems (Q2986450):
Displaying 16 items.
- Deterministic convolutional compressed sensing matrices (Q324274) (← links)
- Nearly optimal codebooks based on generalized Jacobi sums (Q1801063) (← links)
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes (Q2008183) (← links)
- Determinantal conditions for homomorphic sensing (Q2093512) (← links)
- Generalized asymptotically optimal codebooks (Q2180662) (← links)
- Deterministic construction of compressed sensing matrices from constant dimension codes (Q2197399) (← links)
- Three deterministic constructions of compressed sensing matrices with low coherence (Q2202898) (← links)
- Bipolar measurement matrix using chaotic sequence (Q2207348) (← links)
- An effective algorithm for the spark of sparse binary measurement matrices (Q2287709) (← links)
- Deterministic constructions of compressed sensing matrices based on codes (Q2311429) (← links)
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields (Q2410045) (← links)
- Cayley sum graphs and their applications to codebooks (Q2697479) (← links)
- Deterministic construction of compressed sensing matrices with characters over finite fields (Q4554544) (← links)
- Chaotic Binary Sensing Matrices (Q5197651) (← links)
- Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound (Q6047448) (← links)
- Hybrid character sums and near-optimal partial Hadamard codebooks (Q6052932) (← links)