Deterministic construction of compressed sensing matrices based on semilattices

DOI10.1007/s10878-017-0162-9zbMath1469.94028OpenAlexW2740312632MaRDI QIDQ1698065

Jun Guo, Junli Liu

Publication date: 21 February 2018

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

Full work available at URL: https://doi.org/10.1007/s10878-017-0162-9

zbMATH Keywords

semilatticecompressed sensingdeterministic construction

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorics of partially ordered sets (06A07) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Semilattices (06A12)

Cites Work

• Pooling semilattices and non-adaptive pooling designs
• Explicit constructions of RIP matrices and related problems
• Pooling spaces and non-adaptive pooling designs
• Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs
• Erdős-Ko-Rado theorems in certain semilattices
• Deterministic constructions of compressed sensing matrices
• 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
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Deterministic Construction of Sparse Sensing Matrices via Finite Geometry
• Compressed sensing

This page was built for publication: Deterministic construction of compressed sensing matrices based on semilattices