On the public citation graph
Signal-space characterization of iterative decoding
0 signed · 103 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.1016/s0898-1221(99)90253-5openalex-snapshot
Graphical models for machine learning and digital communication
inferredcites →https://doi.org/10.1049/el:19960321openalex-snapshot
Effective free distance of turbo codes
inferredcites →https://doi.org/10.1049/el:19960793openalex-snapshot
Iterative decoding of serially concatenated convolutionalcodes
inferredcites →https://doi.org/10.1049/el:19961141openalex-snapshot
Near Shannon limit performance of low density paritycheck codes
inferredcites →https://doi.org/10.1049/el:19970362openalex-snapshot
Near Shannon limit performance of low density paritycheck codes
inferredcites →https://doi.org/10.1109/18.21245openalex-snapshot
Coset codes. I. Introduction and geometrical classification
inferredcites →https://doi.org/10.1109/18.476317openalex-snapshot
On the trellis structure of block codes
inferredcites →https://doi.org/10.1109/18.485713openalex-snapshot
Unveiling turbo codes: some results on parallel concatenated coding schemes
inferredcites →https://doi.org/10.1109/18.485714openalex-snapshot
Iterative decoding of binary block and convolutional codes
inferredcites →https://doi.org/10.1109/18.508834openalex-snapshot
On the BCJR trellis for linear block codes
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.910572openalex-snapshot
Factor graphs and the sum-product algorithm
inferredcites →https://doi.org/10.1109/18.910576openalex-snapshot
Improved low-density parity-check codes using irregular graphs
inferredcites →https://doi.org/10.1109/18.910578openalex-snapshot
Design of capacity-approaching irregular low-density parity-check codes
inferredcites →https://doi.org/10.1109/26.539767openalex-snapshot
Near optimum error correcting coding and decoding: turbo-codes
inferredcites →https://doi.org/10.1109/49.661103openalex-snapshot
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
inferredcites →https://doi.org/10.1109/49.661110openalex-snapshot
Iterative decoding of compound codes by probability propagation in graphical models
inferredcites →https://doi.org/10.1109/icc.1993.397580openalex-snapshot
Separable MAP "filters" for the decoding of product and concatenated codes
inferredcites →https://doi.org/10.1109/isit.1997.612921openalex-snapshot
A general algorithm for distributing information in a graph
inferredcites →https://doi.org/10.1109/isit.1998.708706openalex-snapshot
Improved low-density parity-check codes using irregular graphs and belief propagation
inferredcites →https://doi.org/10.1109/isit.1998.708741openalex-snapshot
Skewness and pseudocodewords in iterative decoding
inferredcites →https://doi.org/10.1109/isit.1998.708881openalex-snapshot
Iterative decoding on graphs with a single cycle
inferredcites →https://doi.org/10.1109/isit.1998.708883openalex-snapshot
Turbo-decoding from a geometric perspective
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.1109/tit.1981.1056404openalex-snapshot
A recursive approach to low complexity codes
inferredcites →https://doi.org/10.1109/tit.1982.1056454openalex-snapshot
Channel coding with multilevel/phase signals
inferredcites →https://doi.org/10.1109/tit.1987.1057291openalex-snapshot
New trellis codes based on lattices and cosets
inferredcites →https://doi.org/10.1162/089976600300015880openalex-snapshot
Correctness of Local Probability Propagation in Graphical Models with Loops
inferredcites →https://doi.org/10.7551/mitpress/3348.001.0001openalex-snapshot
Graphical Models for Machine Learning and Digital Communication
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-0-387-78263-8_12openalex-snapshot
Convolutional, Turbo, and Turbo-Like Codes for Digital Multimedia Broadcasting: Theory and Applications
inferred← citeshttps://doi.org/10.1007/978-981-96-2015-9_3openalex-snapshot
WiMAX and LTE Technologies Comparison for Mobile Broadband Standards
inferred← citeshttps://doi.org/10.1007/s11128-024-04568-7openalex-snapshot
Syndrome decoding by quantum approximate optimization
inferred← citeshttps://doi.org/10.1016/b978-0-12-396499-1.00006-6openalex-snapshot
Failures and Error Floors of Iterative Decoders
inferred← citeshttps://doi.org/10.1016/j.dcan.2022.11.013openalex-snapshot
Doped low-density parity-check codes
inferred← citeshttps://doi.org/10.1023/b:stco.0000021412.33763.d5openalex-snapshot
Tree consistency and bounds on the performance of the max-product algorithm and its generalizations
inferred← citeshttps://doi.org/10.1109/18.910585openalex-snapshot
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
inferred← citeshttps://doi.org/10.1109/allerton.2011.6120176openalex-snapshot
Decomposition methods for large scale LP decoding
inferred← citeshttps://doi.org/10.1109/allerton.2011.6120280openalex-snapshot
Causes and dynamics of LDPC error floors on AWGN channels
inferred← citeshttps://doi.org/10.1109/ciss.2010.5464748openalex-snapshot
Unconstrained minimization of quadratic functions via min-sum
inferred← citeshttps://doi.org/10.1109/icc.2005.1494431openalex-snapshot
Design of variable-rate irregular LDPC codes with low error floor
inferred← citeshttps://doi.org/10.1109/isit.2002.1023412openalex-snapshot
Turbo decoding visualisation for a simple product code
inferred← citeshttps://doi.org/10.1109/isit.2004.1365106openalex-snapshot
LP decoding corrects a constant fraction of errors
inferred← citeshttps://doi.org/10.1109/isit.2005.1523448openalex-snapshot
Relaxation bounds on the minimum pseudo-weight of linear block codes
inferred← citeshttps://doi.org/10.1109/isit.2006.262096openalex-snapshot
A Method for Constructing LDPC Codes with Low Error Floor
inferred← citeshttps://doi.org/10.1109/isit.2009.5205738openalex-snapshot
Decreasing error floor in LDPC codes by parity-check matrix extensions
inferred← citeshttps://doi.org/10.1109/isit.2010.5513620openalex-snapshot
Multilevel decoders surpassing belief propagation on the binary symmetric channel
inferred← citeshttps://doi.org/10.1109/isit.2012.6284049openalex-snapshot
Quantized min-sum decoders with low error floor for LDPC codes
inferred← citeshttps://doi.org/10.1109/ismict51748.2021.9434940openalex-snapshot
A Construction Method of Doped Low-Density Parity-Check Codes Based on Quadratic Residue Codes
inferred← citeshttps://doi.org/10.1109/istc.2010.5613852openalex-snapshot
Connections between problematic trapping sets and deviations on the computation trees of LDPC codes
inferred← citeshttps://doi.org/10.1109/ita.2010.5454076openalex-snapshot
Iterative decoding beyond belief propagation
inferred← citeshttps://doi.org/10.1109/itw.2009.5351244openalex-snapshot
On the dynamics of the error floor behavior in regular LDPC codes
inferred← citeshttps://doi.org/10.1109/jproc.2024.3416050openalex-snapshot
Trends in Channel Coding for 6G
inferred← citeshttps://doi.org/10.1109/jsac.2009.090804openalex-snapshot
Instanton-based techniques for analysis and reduction of error floors of LDPC codes
inferred← citeshttps://doi.org/10.1109/jsait.2023.3338326openalex-snapshot
Dimensions of Channel Coding: From Theory to Algorithms to Applications
inferred← citeshttps://doi.org/10.1109/spcom.2012.6290251openalex-snapshot
Will the real error floor please stand up?
inferred← citeshttps://doi.org/10.1109/tcomm.2008.050022openalex-snapshot
Design of versatile eIRA codes for parallel decoders
inferred← citeshttps://doi.org/10.1109/tcomm.2008.050658openalex-snapshot
Constructing LDPC codes by error minimization progressive edge growth
inferred← citeshttps://doi.org/10.1109/tcomm.2011.022811.090131openalex-snapshot
Pseudocodeword Weights for LDPC Codes under Differential PSK Transmission over the Noncoherent AWGN Channel
inferred← citeshttps://doi.org/10.1109/tcomm.2012.020912.110428openalex-snapshot
On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2012.091012.110830openalex-snapshot
A Deviation-Based Conditional Upper Bound on the Error Floor Performance for Min-Sum Decoding of Short LDPC Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2013.071813.120659openalex-snapshot
Controlling the Error Floor in LDPC Decoding
inferred← citeshttps://doi.org/10.1109/tcomm.2013.112313.120917openalex-snapshot
Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2015.2498161openalex-snapshot
Breaking the Trapping Sets in LDPC Codes: Check Node Removal and Collaborative Decoding
inferred← citeshttps://doi.org/10.1109/tcomm.2017.2708088openalex-snapshot
Thresholds of Absorbing Sets in Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1109/tit.2002.1013124openalex-snapshot
High-performance iterative Viterbi algorithm for conventional serial concatenated codes
inferred← citeshttps://doi.org/10.1109/tit.2003.821970openalex-snapshot
Maximizing the Spectral Efficiency of Coded CDMA Under Successive Decoding
inferred← citeshttps://doi.org/10.1109/tit.2004.824914openalex-snapshot
Interleaver Pruning for Construction of Variable-Length Turbo Codes
inferred← citeshttps://doi.org/10.1109/tit.2004.828065openalex-snapshot
Interleaver Design for Serially Concatenated Convolutional Codes: Theory and Application
inferred← citeshttps://doi.org/10.1109/tit.2004.842696openalex-snapshot
Using Linear Programming to Decode Binary Linear Codes
inferred← citeshttps://doi.org/10.1109/tit.2005.856938openalex-snapshot
MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
inferred← citeshttps://doi.org/10.1109/tit.2005.862080openalex-snapshot
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels
inferred← citeshttps://doi.org/10.1109/tit.2006.878215openalex-snapshot
Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression
inferred← citeshttps://doi.org/10.1109/tit.2006.887523openalex-snapshot
LP Decoding Corrects a Constant Fraction of Errors
inferred← citeshttps://doi.org/10.1109/tit.2006.889701openalex-snapshot
Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques
inferred← citeshttps://doi.org/10.1109/tit.2007.907501openalex-snapshot
Pseudocodewords of Tanner Graphs
inferred← citeshttps://doi.org/10.1109/tit.2010.2048448openalex-snapshot
On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2094815openalex-snapshot
Divide and Concur and Difference-Map BP Decoders for LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2094819openalex-snapshot
Enumerators for Protograph-Based Ensembles of LDPC and Generalized LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2102090openalex-snapshot
The Scientific Legacy of Ralf Koetter
inferred← citeshttps://doi.org/10.1109/tit.2011.2173244openalex-snapshot
Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds
inferred← citeshttps://doi.org/10.1109/tit.2013.2264715openalex-snapshot
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
inferred← citeshttps://doi.org/10.1109/tit.2013.2281372openalex-snapshot
Decomposition Methods for Large Scale LP Decoding
inferred← citeshttps://doi.org/10.1109/tmag.2008.917367openalex-snapshot
Finite-Length Extrinsic Information Transfer (EXIT) Analysis for Coded and Precoded ISI Channels
inferred← citeshttps://doi.org/10.1109/trustcom.2012.192openalex-snapshot
Joint Source-Channel Coding Based on P-LDPC Codes for Radiography Images Transmission
inferred← citeshttps://doi.org/10.1155/2010/432495openalex-snapshot
The Manifestation of Stopping Sets and Absorbing Sets as Deviations on the Computation Trees of LDPC Codes
inferred← citeshttps://doi.org/10.1162/089976600300015880openalex-snapshot
Correctness of Local Probability Propagation in Graphical Models with Loops
inferred← citeshttps://doi.org/10.1561/2200000001openalex-snapshot
Graphical Models, Exponential Families, and Variational Inference
inferred← citeshttps://doi.org/10.1561/9781601981851openalex-snapshot
Graphical Models, Exponential Families, and Variational Inference
inferred← citeshttps://doi.org/10.48550/arxiv.1001.1730openalex-snapshot
Divide & Concur and Difference-Map BP Decoders for LDPC Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1204.0556openalex-snapshot
Decomposition Methods for Large Scale LP Decoding
inferred← citeshttps://doi.org/10.48550/arxiv.1212.0171openalex-snapshot
Message-Passing Algorithms for Quadratic Minimization
inferred← citeshttps://doi.org/10.48550/arxiv.1310.3416openalex-snapshot
Impact of Interleaver Pruning on Properties of Underlying Permutations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0508070openalex-snapshot
MAP estimation via agreement on (hyper)trees: Message-passing and linear programming
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0512078openalex-snapshot
Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0609154openalex-snapshot
Loop Calculus Helps to Improve Belief Propagation and Linear Programming Decodings of Low-Density-Parity-Check Codes
inferred← citeshttps://doi.org/10.5555/1070432.1070496openalex-snapshot
LP decoding achieves capacity
inferred← citeshttps://doi.org/10.70675/4205c5fez5b33z4aa0z87ebz27036070db26openalex-snapshot
Iterative decoding beyond belief propagation for low-density parity-check codes
inferred← citeshttps://doi.org/10.7939/r39p42openalex-snapshot
Controlling the Error Floors of the Low-Density Parity-Check Codes
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.