On the Doubly Sparse Compressed Sensing Problem
From MaRDI portal
Publication:3460106
DOI10.1007/978-3-319-27239-9_11zbMath1376.94009arXiv1509.07145OpenAlexW2256864149MaRDI QIDQ3460106
Cédric Tavernier, S. G. Vleduts, Grigory Kabatiansky
Publication date: 12 January 2016
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.07145
Related Items (2)
Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing ⋮ Separable collusion-secure multimedia codes
Cites Work
- Unnamed Item
- On error correction with errors in both the channel and syndrome
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Compressed sensing
This page was built for publication: On the Doubly Sparse Compressed Sensing Problem