Deterministic construction of compressed sensing matrices from constant dimension codes

DOI10.1016/j.dam.2020.04.032zbMath1458.94138OpenAlexW3034564058MaRDI QIDQ2197399

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

Publication date: 31 August 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.04.032

zbMATH Keywords

coherencesparsitycompressed sensingrestricted isometry propertyconstant dimension codes

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Other types of codes (94B60) Sampling theory in information and communication theory (94A20)

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
• Johnson type bounds on constant dimension codes
• 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
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• Deterministic Sensing Matrices Arising From Near Orthogonal Systems
• Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
• Compressed sensing and best 𝑘-term approximation
• Decoding by Linear Programming
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Coding for Errors and Erasures in Random Network Coding
• 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
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
• Error-Correcting Codes in Projective Space
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: Deterministic construction of compressed sensing matrices from constant dimension codes