Three deterministic constructions of compressed sensing matrices with low coherence

DOI10.1007/S12095-019-00375-5MaRDI QIDQ2202898zbMATH OpenOpenAlexWikidataFDO

Authors Xiwang Cao, Gaojun Luo, Guangkui Xu

Publication date 30 September 2020

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12095-019-00375-5

zbMATH Keywords

Gauss sumcompressed sensinglinear codecombinatorial configuration

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Finite fields (field-theoretic aspects) (12E20) Estimates on character sums (11L40)

Recommendations

• Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
• Deterministic constructions of compressed sensing matrices
• Deterministic construction of compressed sensing matrices with characters over finite fields
• Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
• New construction of deterministic compressed sensing matrices based on vector space over finite fields

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• A simple proof of the restricted isometry property for random matrices
• A survey of partial difference sets
• Achieving the Welch Bound With Difference Sets
• Compressed sensing
• Decoding by Linear Programming
• Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
• Deterministic Construction of Sparse Sensing Matrices via Finite Geometry
• Deterministic Sensing Matrices Arising From Near Orthogonal Systems
• Equiangular lines, mutually unbiased bases, and spin models
• Grassmannian frames with applications to coding and communication
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• New nearly optimal codebooks from relative difference sets
• On the Dual of Monomial Quadratic p-ary Bent Functions
• On the number of solutions of certain diagonal equations over finite fields
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Reed-Muller sensing matrices and the LASSO (invited paper)
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Steiner equiangular tight frames
• The CRC handbook of combinatorial designs
• The restricted isometry property and its implications for compressed sensing

Cited in

(5)

• On block coherence of frames
• Deterministic construction of sparse binary matrices via incremental integer optimization
• Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
• Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices
• Sampling, denoising and compression of matrices by coherent matrix organization

This page was built for publication: Three deterministic constructions of compressed sensing matrices with low coherence

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