On the public citation graph
Parallel versus sequential updating for belief propagation decoding
0 signed · 102 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb00917.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1016/0167-2789(90)90082-zopenalex-snapshot
Synchronous or asynchronous parallel dynamics. Which is more efficient?
inferredcites →https://doi.org/10.1038/339693a0openalex-snapshot
Spin-glass models as error-correcting codes
inferredcites →https://doi.org/10.1049/el:19970362openalex-snapshot
Near Shannon limit performance of low density paritycheck codes
inferredcites →https://doi.org/10.1088/0305-4470/33/8/311openalex-snapshot
Finite-size effects and error-free communication in Gaussian channels
inferredcites →https://doi.org/10.1103/physreve.61.2137openalex-snapshot
Cascading parity-check error-correcting codes
inferredcites →https://doi.org/10.1103/physrevlett.83.2660openalex-snapshot
Error-Correcting Codes That Nearly Saturate Shannon's Bound
inferredcites →https://doi.org/10.1109/18.748992openalex-snapshot
Good error-correcting codes based on very sparse matrices
inferredcites →https://doi.org/10.1109/18.910576openalex-snapshot
Improved low-density parity-check codes using irregular graphs
inferredcites →https://doi.org/10.1109/isit.2000.866497openalex-snapshot
Design of provably good low-density parity check codes
inferredcites →https://doi.org/10.1109/tit.1962.1057683openalex-snapshot
Low-density parity-check codes
inferredcites →https://doi.org/10.1209/epl/i1999-00137-2openalex-snapshot
Statistical mechanics of error-correcting codes
inferredcites →https://doi.org/10.7551/mitpress/4347.001.0001openalex-snapshot
Low-Density Parity-Check Codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-23525-7_18openalex-snapshot
Message Scheduling Methods for Belief Propagation
inferred← citeshttps://doi.org/10.1007/978-3-642-24082-9_46openalex-snapshot
Serial Scheduling Algorithm of LDPC Decoding
inferred← citeshttps://doi.org/10.1007/s11265-021-01680-0openalex-snapshot
Fast-Converging and Low-Power LDPC Decoding: Algorithm, Architecture, and VLSI Implementation
inferred← citeshttps://doi.org/10.1016/j.jmsy.2015.06.001openalex-snapshot
A new statistical approach to automated quality control in manufacturing processes
inferred← citeshttps://doi.org/10.1016/j.physa.2006.12.009openalex-snapshot
Parallel vs. sequential belief propagation decoding of LDPC codes over and Markov sources
inferred← citeshttps://doi.org/10.1016/j.physa.2021.125754openalex-snapshot
A+A→0 system in one dimension with particle motion determined by nearest neighbour distances: Results for parallel updates
inferred← citeshttps://doi.org/10.1049/el.2015.1049openalex-snapshot
Syndrome‐based scheduling: simple adaptive scheduling technique for decoding LDPC codes
inferred← citeshttps://doi.org/10.1088/0305-4470/38/33/r01openalex-snapshot
Cluster variation method in statistical physics and probabilistic graphical models
inferred← citeshttps://doi.org/10.1093/ietcom/e90-b.3.440openalex-snapshot
LDPC Codes in Communications and Broadcasting
inferred← citeshttps://doi.org/10.1093/ietcom/e91-b.8.2640openalex-snapshot
Convergence Acceleration of Iterative Signal Detection for MIMO System with Belief Propagation
inferred← citeshttps://doi.org/10.1103/physreve.85.011134openalex-snapshot
Dynamics of competitive learning: The role of updates and memory
inferred← citeshttps://doi.org/10.1109/acssc.2002.1197141openalex-snapshot
Shuffled belief propagation decoding
inferred← citeshttps://doi.org/10.1109/allerton.2015.7447073openalex-snapshot
Balanced codes for data retention of multi-level flash memories with fast page read
inferred← citeshttps://doi.org/10.1109/chinacom.2015.7497930openalex-snapshot
Improved decoding of LDPC codes by variable-to-check residual belief propagation
inferred← citeshttps://doi.org/10.1109/ciss.2006.286584openalex-snapshot
High-Throughput Turbo-Sum-Product Decoding of QC LDPC Codes
inferred← citeshttps://doi.org/10.1109/comnet.2014.6840905openalex-snapshot
A new optimization of group shuffled LDPC decoding
inferred← citeshttps://doi.org/10.1109/dsd.2006.63openalex-snapshot
Layered Decoding of Non-Layered LDPC Codes
inferred← citeshttps://doi.org/10.1109/dsp-spe.2015.7369543openalex-snapshot
Fast detection of OFDM systems using graphical models
inferred← citeshttps://doi.org/10.1109/eeei.2004.1361130openalex-snapshot
An efficient message-passing schedule for LDPC decoding
inferred← citeshttps://doi.org/10.1109/eeei.2008.4736667openalex-snapshot
Generalized serial schedules for iterative decoding of LDPC codes
inferred← citeshttps://doi.org/10.1109/glocom.2005.1577843openalex-snapshot
Reduced latency iterative decoding of LDPC codes
inferred← citeshttps://doi.org/10.1109/glocom.2006.824openalex-snapshot
WLC36-2: Convergence Acceleration of Iterative Signal Detection for MIMO System with Belief Propagation
inferred← citeshttps://doi.org/10.1109/glocom.2007.620openalex-snapshot
A Scalable Decoder Architecture for IEEE 802.11n LDPC Codes
inferred← citeshttps://doi.org/10.1109/glocom.2009.5426153openalex-snapshot
Near-Shannon-Limit Linear-Time-Encodable Nonbinary Irregular LDPC Codes
inferred← citeshttps://doi.org/10.1109/glocom.2016.7841913openalex-snapshot
Interlaced Column-Row Message-Passing Schedule for Decoding LDPC Codes
inferred← citeshttps://doi.org/10.1109/honet.2012.6421434openalex-snapshot
Fast decoding of low density parity check codes
inferred← citeshttps://doi.org/10.1109/icassp.2008.4518271openalex-snapshot
Structure of non-binary regular ldpc cycle codes
inferred← citeshttps://doi.org/10.1109/icc.2007.158openalex-snapshot
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
inferred← citeshttps://doi.org/10.1109/icc.2008.225openalex-snapshot
Lower-Complexity Layered Belief-Propagation Decoding of LDPC Codes
inferred← citeshttps://doi.org/10.1109/icc.2010.5501811openalex-snapshot
On the Fair Comparison of FEC Schemes
inferred← citeshttps://doi.org/10.1109/icc.2011.5962813openalex-snapshot
Improved Decoding of Binary and Non-Binary LDPC Codes by Probabilistic Shuffled Belief Propagation
inferred← citeshttps://doi.org/10.1109/icct.2011.6157861openalex-snapshot
Improved extrinsic information scheduling for non-binary cycle codes
inferred← citeshttps://doi.org/10.1109/icmcs.2014.6911170openalex-snapshot
An optimized min-sum variable node layering for LDPC decoding
inferred← citeshttps://doi.org/10.1109/icspcs50536.2020.9310025openalex-snapshot
Performance of Lossy P-LDPC Codes over GF(2)
inferred← citeshttps://doi.org/10.1109/ict.2017.7998249openalex-snapshot
BER comparison between Convolutional, Turbo, LDPC, and Polar codes
inferred← citeshttps://doi.org/10.1109/isit.2005.1523375openalex-snapshot
Replica shuffled iterative decoding
inferred← citeshttps://doi.org/10.1109/isit.2007.4557171openalex-snapshot
Edge-based Scheduled BP in LDPC Codes
inferred← citeshttps://doi.org/10.1109/isit.2008.4595167openalex-snapshot
Efficient layers-based schedules for iterative decoding of LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.2008.4595237openalex-snapshot
Iterative approximate linear programming decoding of LDPC codes with linear complexity
inferred← citeshttps://doi.org/10.1109/isit.2009.5205776openalex-snapshot
Analysis of LDPC decoding schedules
inferred← citeshttps://doi.org/10.1109/isit.2014.6875382openalex-snapshot
Enhanced belief propagation decoding of polar codes through concatenation
inferred← citeshttps://doi.org/10.1109/isit.2015.7282942openalex-snapshot
Asynchronous decoding of LDPC codes over BEC
inferred← citeshttps://doi.org/10.1109/isvlsi.2017.42openalex-snapshot
A Multi-Gbps Fully Pipelined Layered Decoder for IEEE 802.11n/ac/ax LDPC Codes
inferred← citeshttps://doi.org/10.1109/iswcs49558.2021.9562199openalex-snapshot
Decoding of Moderate Length LDPC Codes via Learned Clustered Check Node Scheduling
inferred← citeshttps://doi.org/10.1109/itw.2012.6404660openalex-snapshot
Reduced complexity window decoding schedules for coupled LDPC codes
inferred← citeshttps://doi.org/10.1109/jlt.2007.903311openalex-snapshot
Low-Latency Decoding of EG LDPC Codes
inferred← citeshttps://doi.org/10.1109/jsac.2008.081208openalex-snapshot
Nonbinary LDPC Coding for Multicarrier Underwater Acoustic Communication
inferred← citeshttps://doi.org/10.1109/jsac.2009.090819openalex-snapshot
Convergence analysis of generalized serial message-passing schedules
inferred← citeshttps://doi.org/10.1109/lcomm.2005.1437365openalex-snapshot
Convergence rates comparison of sum-product decoding of RA codes under different message-passing schedules
inferred← citeshttps://doi.org/10.1109/lcomm.2008.080260openalex-snapshot
Decoding with Early Termination for Raptor Codes
inferred← citeshttps://doi.org/10.1109/lcomm.2009.081938openalex-snapshot
Two-staged informed dynamic scheduling for sequential belief propagation decoding of LDPC codes
inferred← citeshttps://doi.org/10.1109/lcomm.2009.12.091555openalex-snapshot
An efficient dynamic schedule for layered belief-propagation decoding of LDPC codes
inferred← citeshttps://doi.org/10.1109/lcomm.2010.07.092417openalex-snapshot
Adaptive Mixed Scheduling for Correcting Errors in Trapping Sets of LDPC Codes
inferred← citeshttps://doi.org/10.1109/lcomm.2012.050112.120262openalex-snapshot
Trapping Set Error Correction through Adaptive Informed Dynamic Scheduling Decoding of LDPC Codes
inferred← citeshttps://doi.org/10.1109/lcomm.2016.2643629openalex-snapshot
Reduced Complexity Node-Wise Scheduling of ADMM Decoding for LDPC Codes
inferred← citeshttps://doi.org/10.1109/milcom.2008.4753232openalex-snapshot
Performance under delay constraints on iterative decoding of LDPC codes
inferred← citeshttps://doi.org/10.1109/tcomm.2004.841982openalex-snapshot
Shuffled Iterative Decoding
inferred← citeshttps://doi.org/10.1109/tcomm.2007.908517openalex-snapshot
Generic Description and Synthesis of LDPC Decoders
inferred← citeshttps://doi.org/10.1109/tcomm.2008.040571openalex-snapshot
Sequential message-passing decoding of LDPC codes by partitioning check nodes
inferred← citeshttps://doi.org/10.1109/tcomm.2009.04.060349openalex-snapshot
Memory-efficient and high-throughput decoding of quasi-cyclic LDPC codes
inferred← citeshttps://doi.org/10.1109/tcomm.2009.0901.050650openalex-snapshot
Low-density parity-check codes with 2-state trellis decoding
inferred← citeshttps://doi.org/10.1109/tcomm.2010.04.080558openalex-snapshot
Structure, property, and design of nonbinary regular cycle codes
inferred← citeshttps://doi.org/10.1109/tcomm.2010.101910.070303openalex-snapshot
LDPC Decoders with Informed Dynamic Scheduling
inferred← citeshttps://doi.org/10.1109/tcomm.2011.072011.100438openalex-snapshot
Effective Informed Dynamic Scheduling for Belief Propagation Decoding of LDPC Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3296621openalex-snapshot
RELDEC: Reinforcement Learning-Based Decoding of Moderate Length LDPC Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2026.3712534openalex-snapshot
Reduced Complexity Layered CPA List Decoders for Reed–Muller Codes
inferred← citeshttps://doi.org/10.1109/tcsii.2021.3049733openalex-snapshot
Fast Column Message-Passing Decoding of Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1109/telsks.2017.8246286openalex-snapshot
Generic architectures for uniformly reweighted APP decoders
inferred← citeshttps://doi.org/10.1109/tit.2007.894683openalex-snapshot
Iterative Decoding With Replicas
inferred← citeshttps://doi.org/10.1109/tit.2007.907507openalex-snapshot
Efficient Serial Message-Passing Schedules for LDPC Decoding
inferred← citeshttps://doi.org/10.1109/tit.2007.915702openalex-snapshot
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
inferred← citeshttps://doi.org/10.1109/tit.2009.2030477openalex-snapshot
Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
inferred← citeshttps://doi.org/10.1109/tit.2025.3599674openalex-snapshot
Reduced Complexity Interval Passing for Sparse Signal Recovery
inferred← citeshttps://doi.org/10.1109/tmag.2011.2155049openalex-snapshot
Serial Belief Propagation for The High-Rate LDPC Decoders and Performances in The Bit Patterned Media Systems With Media Noise
inferred← citeshttps://doi.org/10.1109/tmag.2012.2204043openalex-snapshot
Modified Graph-Based Detection Methods for Two-Dimensional Interference Channels
inferred← citeshttps://doi.org/10.1109/vlsisoc.2007.4402504openalex-snapshot
A minimum-latency block-serial architecture of a decoder for IEEE 802.11n LDPC codes
inferred← citeshttps://doi.org/10.1109/wcica.2010.5554812openalex-snapshot
Application of 2-state trellis LDPC code in OFDM system
inferred← citeshttps://doi.org/10.1109/wcnc.2008.49openalex-snapshot
Decoding with Early Termination for Rateless (Luby Transform) Codes
inferred← citeshttps://doi.org/10.1109/wicom.2009.5303121openalex-snapshot
Dynamic Schedules Based on Variable Nodes Residual for LDPC Codes
inferred← citeshttps://doi.org/10.1109/wifs.2009.5386479openalex-snapshot
Leveraging reliable bits: ECC design considerations for practical secure biometric systems
inferred← citeshttps://doi.org/10.1155/2011/184635openalex-snapshot
Fixed-Point MAP Decoding of Channel Codes
inferred← citeshttps://doi.org/10.1155/2013/371206openalex-snapshot
Weighted-Bit-Flipping-Based Sequential Scheduling Decoding Algorithms for LDPC Codes
inferred← citeshttps://doi.org/10.1587/transcom.2016fgp0012openalex-snapshot
Serial and Parallel LLR Updates Using Damped LLR for LDPC Coded Massive MIMO Detection with Belief Propagation
inferred← citeshttps://doi.org/10.22215/etd/2021-14362openalex-snapshot
ADMM Decoding of LDPC Codes: Simplification and Improvement
inferred← citeshttps://doi.org/10.48550/arxiv.0801.1208openalex-snapshot
Hybrid Decoding of Finite Geometry LDPC Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1206.6837openalex-snapshot
Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing
inferred← citeshttps://doi.org/10.48550/arxiv.1705.05996openalex-snapshot
A Survey on Trapping Sets and Stopping Sets
inferred← citeshttps://doi.org/10.7149/opa.56.1.51121openalex-snapshot
BER improvement in 5G MU MIMO-OFDM systems using channel coding techniques
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.