Efficient Serial Message-Passing Schedules for LDPC Decoding

DOI10.1109/TIT.2007.907507zbMATH Open1325.94170OpenAlexW2151296558MaRDI QIDQ3548918FDOQ3548918

Authors: Jacob Goldberger, Eran Sharon, Simon Litsyn 

Publication date: 21 December 2008

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

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

Recommendations

• Serial Schedules for Belief-Propagation: Analysis of Convergence Time
• scientific article
• On Designing Good LDPC Codes for Markov Channels
• Iterative decoding of LDPC codes: some bounds and properties
• Efficient encoding of low-density parity-check codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Decoding (94B35) Network protocols (68M12)

Cited In (7)

• Title not available (Why is that?)
• Convergence Analysis and Optimal Scheduling for Multiple Concatenated Codes
• An asymptotic distribution theory for Eulerian recurrences with applications
• Message passing algorithms and improved LP decoding
• Serial Schedules for Belief-Propagation: Analysis of Convergence Time
• Reducing the complexity of the layer scheduled LDPC decoder based on the information bottleneck method
• Recursive descriptions of polar codes

This page was built for publication: Efficient Serial Message-Passing Schedules for LDPC Decoding

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