Paper Info
Title
The Sum-Product Algorithm for Degree-2 Check Nodes and Trapping Sets.
Abstract
The sum-product algorithm for decoding of binary codes is analyzed for bipartite graphs in which the check nodes all have degree $2$. The algorithm simplifies dramatically and may be expressed using linear algebra. Exact results about the convergence of the algorithm are derived and applied to trapping sets.
Year
Venue
Field
2014
CoRR
Convergence (routing),Linear algebra,Discrete mathematics,Combinatorics,Ramer–Douglas–Peucker algorithm,Binary code,Bipartite graph,Sum product algorithm,Trapping,Decoding methods,Mathematics
DocType
Volume
Citations 
Journal
abs/1411.2169
0
PageRank 
References 
Authors
0.34
4
2
Name
Order
Citations
PageRank
John O. Brevik100.34
Michael E. O'Sullivan200.68