Deterministic Sensing Matrices Arising From Near Orthogonal Systems

DOI10.1109/TIT.2014.2303973zbMath1360.94084OpenAlexW1966655654MaRDI QIDQ2986450

Gennian Ge, Shuxing Li

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2014.2303973

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (15)

Deterministic convolutional compressed sensing matrices ⋮ Deterministic construction of compressed sensing matrices with characters over finite fields ⋮ Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields ⋮ Generalized asymptotically optimal codebooks ⋮ Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound ⋮ Hybrid character sums and near-optimal partial Hadamard codebooks ⋮ Deterministic construction of compressed sensing matrices from constant dimension codes ⋮ Three deterministic constructions of compressed sensing matrices with low coherence ⋮ Cayley sum graphs and their applications to codebooks ⋮ Bipolar measurement matrix using chaotic sequence ⋮ Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes ⋮ Chaotic Binary Sensing Matrices ⋮ An effective algorithm for the spark of sparse binary measurement matrices ⋮ Nearly optimal codebooks based on generalized Jacobi sums ⋮ Deterministic constructions of compressed sensing matrices based on codes

This page was built for publication: Deterministic Sensing Matrices Arising From Near Orthogonal Systems