Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices

DOI10.1109/TIT.2011.2111670zbMath1366.94078arXiv0908.2676OpenAlexW2119275775MaRDI QIDQ5280997

Arash A. Amini, Farokh A. Marvasti

Publication date: 27 July 2017

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

Full work available at URL: https://arxiv.org/abs/0908.2676

Mathematics Subject Classification ID

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

Related Items (14)

A survey on compressive sensing: classical results and recent advancements ⋮ 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 ⋮ Deterministic construction of compressed sensing matrices from constant dimension codes ⋮ Three deterministic constructions of compressed sensing matrices with low coherence ⋮ Rapid compressed sensing reconstruction: a semi-tensor product approach ⋮ 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 ⋮ Construction of Sparse Binary Sensing Matrices Using Set Systems ⋮ Deterministic Construction of Compressed Sensing Matrices from Codes ⋮ Deterministic constructions of compressed sensing matrices based on codes ⋮ Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs ⋮ Deterministic construction of sparse binary matrices via incremental integer optimization

This page was built for publication: Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices