Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
type: Item
instance of: scholarly article
title: Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
zbMATH Open document ID: 1428.94039
author: Gang Wang
author: Min-Yao Niu
author: Fangwei Fu
published in: Applied Mathematics and Computation
publication date: 2019-11-22T00:00:00Z
Mathematics Subject Classification ID: 94A12
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 7135631
zbMATH Keywords: compressed sensing
zbMATH Keywords: coherence
zbMATH Keywords: sparsity
zbMATH Keywords: restricted isometry property
zbMATH Keywords: optimal codebooks
zbMATH Keywords: codes
describes a project that uses: CoSaMP
MaRDI profile type: Publication
full work available at URL: j.amc.2018.09.042
OpenAlex ID: W2897237705
cites work: Compressed sensing
cites work: Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: Sparse Approximate Solutions to Linear Systems
cites work: Decoding by Linear Programming
cites work: Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
cites work: Subspace Pursuit for Compressive Sensing Signal Reconstruction
cites work: CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
cites work: Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
cites work: Compressed sensing and best 𝑘-term approximation
cites work: A simple proof of the restricted isometry property for random matrices
cites work: Explicit constructions of RIP matrices and related problems
cites work: Lower bounds on the maximum cross correlation of signals (Corresp.)
cites work: Deterministic constructions of compressed sensing matrices
cites work: Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
cites work: Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields
cites work: Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
cites work: Matrices With Small Coherence Using $p$-Ary Block Codes
cites work: Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
cites work: Q3579464
cites work: A Generic Construction of Complex Codebooks Meeting the Welch Bound
cites work: Q4330648
cites work: Complex Codebooks From Combinatorial Designs
cites work: Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
cites work: Deterministic Sensing Matrices Arising From Near Orthogonal Systems
cites work: Spherical codes and designs
cites work: Algebraic Function Fields and Codes
cites work: Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
DOI: 10.1016/J.AMC.2018.09.042
Recommended article: Deterministic constructions of compressed sensing matrices based on codes
Recommended article: Deterministic Construction of Compressed Sensing Matrices from Codes
Recommended article: Deterministic construction of compressed sensing matrices from constant dimension codes
Recommended article: Deterministic constructions of compressed sensing matrices
Recommended article: Q5267510
Recommended article: Deterministic construction of compressed sensing matrices based on semilattices
Recommended article: Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications
Recommended article: Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
Recommended article: Welch bound-achieving compressed sensing matrices from optimal codebooks
Recommended article: Deterministic construction of compressed sensing matrices with characters over finite fields
description: scientific article; zbMATH DE number 7135631