The Sum-Product Algorithm for Degree-2 Check Nodes and Trapping Sets
classification
💻 cs.IT
math.IT
keywords
algorithmchecknodessetssum-producttrappingalgebraanalyzed
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.