Deterministic constructions of compressed sensing matrices based on codes

DOI10.1007/s12095-018-0328-zzbMath1456.94020OpenAlexW2890042823WikidataQ129253346 ScholiaQ129253346MaRDI QIDQ2311429

Min-Yao Niu, Gang Wang, Fang-Wei Fu

Publication date: 10 July 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-018-0328-z

zbMATH Keywords

coherencecodesparsitycompressed sensingrestricted isometry propertydeterministic construction

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Uses Software

• CoSaMP

Cites Work

• Unnamed Item
• Explicit constructions of RIP matrices and related problems
• Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
• A simple proof of the restricted isometry property for random matrices
• Deterministic constructions of compressed sensing matrices
• Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields
• Deterministic Sensing Matrices Arising From Near Orthogonal Systems
• Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
• Compressed sensing and best 𝑘-term approximation
• Algebraic Function Fields and Codes
• Decoding by Linear Programming
• Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Matrices With Small Coherence Using $p$-Ary Block Codes
• Sparse Approximate Solutions to Linear Systems
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Deterministic Construction of Compressed Sensing Matrices from Codes
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: Deterministic constructions of compressed sensing matrices based on codes