Photo from wikipedia
Matrices with low coherence have applications in compressed sensing and some other areas. In this paper, we present three deterministic constructions of compressed sensing matrices by using algebraic and combinatorial… Click to show full abstract
Matrices with low coherence have applications in compressed sensing and some other areas. In this paper, we present three deterministic constructions of compressed sensing matrices by using algebraic and combinatorial methods. We show that our results outperform Gaussian random matrices. Moreover, some of our matrices are binary entries, and thus can be used in the embedding operations to get more matrices with low coherence recursively.
Keywords:
deterministic constructions;
compressed sensing;
three deterministic;
matrices low;
low coherence
Journal Title: Cryptography and Communications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Cryptography and Communications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!