Deterministic Sensing Matrices Arising From Near Orthogonal Systems

DOI10.1109/TIT.2014.2303973MaRDI QIDQ2986450zbMATH OpenOpenAlexFDO

Authors Shuxing Li, Gennian Ge

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)

Cited in

(16)

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

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

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