Peeling decoding of LDPC codes with applications in compressed sensing

DOI10.1155/2016/6340430zbMath1400.94076OpenAlexW2315483793WikidataQ59140868 ScholiaQ59140868MaRDI QIDQ1793437

Weijun Zeng, Huali Wang

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/6340430

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Decoding (94B35) Sampling theory in information and communication theory (94A20)

Cites Work

• A survey of results for deletion channels and related synchronization channels
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Efficient erasure correcting codes
• R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT
• Bayesian Compressive Sensing Via Belief Propagation
• Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
• Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
• Sub-Linear Time Support Recovery for Compressed Sensing Using Sparse-Graph Codes
• LDPC Codes for Compressed Sensing
• Stable signal recovery from incomplete and inaccurate measurements

This page was built for publication: Peeling decoding of LDPC codes with applications in compressed sensing