Modern Codes: LDPC, Polar and Turbo

The sparse-graph and polarization constructions that finally reach capacity in practice, and how they are decoded.0/11 mastered

1 / 11

In successive cancellation,

L^{+} = L_2 + (-1)^{\hat u_1} L_1

. With

L_1 = 0.4

L_2 = 3.0

and

\hat u_1 = 1

, compute

L^{+}

Your answer

#11657