Expander \(\ell_0\)-decoding
From MaRDI portal
Publication:1669068
DOI10.1016/j.acha.2017.03.001OpenAlexW2402686099MaRDI QIDQ1669068
Rodrigo Mendoza-Smith, Jared Tanner
Publication date: 30 August 2018
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.01256
compressed sensingexpander graphsdecoding algorithmscombinatorial compressed sensingdissociated signals
Cites Work
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Iterative hard thresholding for compressed sensing
- GPU accelerated greedy algorithms for compressed sensing
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Performance comparisons of greedy algorithms in compressed sensing
- On Sparse Representation in Fourier and Local Bases
- Verification Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing
- Expander codes
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Randomness conductors and constant-degree lossless expanders
- Efficient erasure correcting codes
- The Restricted Isometry Property of Subsampled Fourier Matrices
- An improved data stream summary: the count-min sketch and its applications
- Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
- Model-Based Compressive Sensing
- Vanishingly Sparse Matrices and Expander Graphs, With Application to Compressed Sensing
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
