Deterministic construction of compressed sensing matrices from constant dimension codes

DOI10.1016/J.DAM.2020.04.032MaRDI QIDQ2197399zbMATH OpenOpenAlexFDO

Authors Gang Wang, Min-Yao Niu, Fangwei 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

coherencecompressed sensingconstant dimension codesrestricted isometry propertysparsity

Mathematics Subject Classification ID

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

Recommendations

• Deterministic constructions of compressed sensing matrices based on codes
• Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
• Deterministic construction of compressed sensing matrices from codes
• Deterministic construction of compressed sensing matrices with characters over finite fields
• Deterministic construction of compressed sensing matrices over finite sets

Cites work

• A simple proof of the restricted isometry property for random matrices
• Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
• Coding for Errors and Erasures in Random Network Coding
• Compressed sensing
• Compressed sensing and best \(k\)-term approximation
• Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Decoding by Linear Programming
• Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
• Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
• Deterministic constructions of compressed sensing matrices
• Deterministic Sensing Matrices Arising From Near Orthogonal Systems
• Error-Correcting Codes in Projective Space
• Existence of q-analogs of Steiner systems
• Explicit constructions of RIP matrices and related problems
• scientific article; zbMATH DE number 5764871 (Why is no real title available?)
• Johnson type bounds on constant dimension codes
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Matrices With Small Coherence Using $p$-Ary Block Codes
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Sparse Approximate Solutions to Linear Systems
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Stable signal recovery from incomplete and inaccurate measurements
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit

Cited in

(10)

• Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
• Deterministic constructions of compressed sensing matrices based on codes
• An asymptotic existence result on compressed sensing matrices
• Deterministic construction of compressed sensing matrices with characters over finite fields
• Deterministic Constructions of Compressed Sensing Matrices From Unitary Geometry
• Welch bound-achieving compressed sensing matrices from optimal codebooks
• Deterministic construction of compressed sensing matrices from codes
• Construction of large cyclic subspace codes via Sidon spaces with dimensions k and k + 1
• Several new kinds of (k+1)-dimensional Sidon spaces and cyclic subspace codes
• Large cyclic subspace codes based on the generalized Sidon spaces

Describes a project that uses

Uses Software

• CoSaMP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197399)