Fig. 1
From: Low-complexity decoding of LDPC codes using reduced-set WBF-based algorithms
A subgraph spreading from variable node j1 associated with a (3,6)-regular LDPC code. The erroneous variable nodes are painted gray
Fig. 1 | EURASIP Journal on Wireless Communications and Networking