LDPC Codes for Compressed Sensing

DOI10.1109/TIT.2011.2181819zbMath1365.94176arXiv1012.0602MaRDI QIDQ5271971

Alexandros G. Dimakis, Pascal O. Vontobel, Roxana Smarandache

Publication date: 12 July 2017

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

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

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear programming (90C05) Linear codes (general theory) (94B05) Sampling theory in information and communication theory (94A20)

Related Items (8)

Polynomial Data Structure Lower Bounds in the Group Model ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Peeling decoding of LDPC codes with applications in compressed sensing ⋮ An effective algorithm for the spark of sparse binary measurement matrices ⋮ Deterministic Construction of Compressed Sensing Matrices from Codes ⋮ Analysis of Termatiko sets in measurement matrices ⋮ 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: LDPC Codes for Compressed Sensing