Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields

DOI10.1007/s10878-016-0068-yzbMath1380.94055OpenAlexW2518459280MaRDI QIDQ2410045

Zhangjie Fu, Yingmo Jie, Cheng Guo

Publication date: 17 October 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0068-y

zbMATH Keywords

coherencecompressed sensing matricesrestricted isometry property (RIP)singular linear spaces

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Uses Software

• CoSaMP

Cites Work

• Unnamed Item
• Explicit constructions of RIP matrices and related problems
• Singular linear space and its applications
• The restricted isometry property and its implications for compressed sensing
• Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Extensions of compressed sensing
• Association schemes based on attenuated spaces
• Grassmannian frames with applications to coding and communication
• Incremental learning for \(\nu\)-support vector regression
• Deterministic constructions of compressed sensing matrices
• Deterministic Sensing Matrices Arising From Near Orthogonal Systems
• Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
• Compressed sensing and best 𝑘-term approximation
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Greed is Good: Algorithmic Results for Sparse Approximation
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• 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
• Deterministic Construction of Sparse Sensing Matrices via Finite Geometry
• Sparse Approximate Solutions to Linear Systems
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
• Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing