Pages that link to "Item:Q635478"
From MaRDI portal
The following pages link to Explicit constructions of RIP matrices and related problems (Q635478):
Displaying 50 items.
- Derandomizing restricted isometries via the Legendre symbol (Q295815) (← links)
- Deterministic convolutional compressed sensing matrices (Q324274) (← links)
- Coherence of sensing matrices coming from algebraic-geometric codes (Q326320) (← links)
- On exact recovery of sparse vectors from linear measurements (Q382361) (← links)
- The road to deterministic matrices with the restricted isometry property (Q485193) (← links)
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- Steiner equiangular tight frames (Q665926) (← links)
- Preserving injectivity under subgaussian mappings and its application to compressed sensing (Q778017) (← links)
- Stability of the elastic net estimator (Q895982) (← links)
- Equiangular tight frames that contain regular simplices (Q1654389) (← links)
- A novel probabilistic approach for vehicle position prediction in free, partial, and full GPS outages (Q1664919) (← links)
- Deterministic construction of compressed sensing matrices based on semilattices (Q1698065) (← links)
- A deterministic sparse FFT for functions with structured Fourier sparsity (Q2000485) (← links)
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes (Q2008183) (← links)
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs (Q2036421) (← links)
- Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs (Q2078717) (← links)
- Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery (Q2124653) (← links)
- An analytic approach to cardinalities of sumsets (Q2151183) (← links)
- Deterministic construction of compressed sensing matrices from constant dimension codes (Q2197399) (← links)
- Deletion correcting codes meet the Littlewood-Offord problem (Q2205891) (← links)
- On the restricted isometry property of the Paley matrix (Q2238859) (← links)
- An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices (Q2251220) (← links)
- Deterministic constructions of compressed sensing matrices based on codes (Q2311429) (← links)
- An asymptotic existence result on compressed sensing matrices (Q2347356) (← links)
- Group-theoretic constructions of erasure-robust frames (Q2348016) (← links)
- Explicit universal sampling sets in finite vector spaces (Q2399652) (← links)
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields (Q2410045) (← links)
- Sergei Vladimirovich Konyagin turns 60 (Q2423205) (← links)
- Deterministic sampling of sparse trigonometric polynomials (Q2431334) (← links)
- Kesten-McKay law for random subensembles of Paley equiangular tight frames (Q2663141) (← links)
- Explicit RIP matrices: an update (Q2681274) (← links)
- Side effects of learning from low-dimensional data embedded in a Euclidean space (Q2687305) (← links)
- On the sparsity of Lasso minimizers in sparse data recovery (Q2700886) (← links)
- (Q2787249) (← links)
- Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields (Q2788564) (← links)
- Compressive Sensing (Q2789803) (← links)
- Mathematics of Electron Tomography (Q2789817) (← links)
- Construction of Sparse Binary Sensing Matrices Using Set Systems (Q2801915) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Theory and applications of compressed sensing (Q2864809) (← links)
- Book Review: A mathematical introduction to compressive sensing (Q3178754) (← links)
- Explicit Matrices with the Restricted Isometry Property: Breaking the Square-Root Bottleneck (Q3460841) (← links)
- Deterministic construction of compressed sensing matrices with characters over finite fields (Q4554544) (← links)
- Flavors of Compressive Sensing (Q4609797) (← links)
- Mathematics of Analog‐to‐Digital Conversion (Q4650167) (← links)
- Packings in Real Projective Spaces (Q4687471) (← links)
- Frames as Codes (Q4912897) (← links)
- Welch bound-achieving compressed sensing matrices from optimal codebooks (Q4965909) (← links)
- Deterministic Construction of Compressed Sensing Matrices from Codes (Q4977889) (← links)
- An Unbiased Approach to Low Rank Recovery (Q5055687) (← links)
