Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
From MaRDI portal
Publication:2078717
DOI10.1016/j.amc.2021.126901OpenAlexW4206533165WikidataQ114210937 ScholiaQ114210937MaRDI QIDQ2078717
Jun-ying Liang, Lixiang Li, Fenghua Tong, Haipeng Peng, Yi-Xian Yang
Publication date: 3 March 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2021.126901
Mathematical programming (90Cxx) Theory of error-correcting codes and error-detecting codes (94Bxx) Communication, information (94Axx)
Cites Work
- Unnamed Item
- Unnamed Item
- Explicit constructions of RIP matrices and related problems
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Three deterministic constructions of compressed sensing matrices with low coherence
- An effective algorithm for the spark of sparse binary measurement matrices
- Deterministic constructions of compressed sensing matrices
- Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
- Decoding by Linear Programming
- Regular and irregular progressive edge-growth tanner graphs
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Deterministic construction of compressed sensing matrices with characters over finite fields
- Matrices With Small Coherence Using $p$-Ary Block Codes
- Deterministic Construction of Sparse Sensing Matrices via Finite Geometry
- Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications
- Sparse Approximate Solutions to Linear Systems
- Deterministic Constructions of Compressed Sensing Matrices From Unitary Geometry
- Deterministic Construction of Compressed Sensing Matrices from Codes
- LDPC Codes for Compressed Sensing
- Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
This page was built for publication: Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs