Figure 4From: Analysis and Construction of Full-Diversity Joint Network-LDPC Codes for Cooperative CommunicationsTwo examples of a decoding tree, where we distinguish a root and the leaves. While decoding, the leaves pass extrinsic information to the root. Both examples are rootchecks; the root can be recovered if bits corresponding to other colors are not erased. (a) recovers the red root bit if all red bits are erased. (b) recovers the blue root bit if all blue bits are erased.Back to article page