CalcPath
Subjects
Dashboard
Diagnostic
Feedback
Search...
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
What is the shortest possible cycle length (girth) in a bipartite Tanner graph?
Review the explanation for this topic →
Your answer
Draw
Hint
Type your answer — press Enter to check
Enter your answer
( )
x
n
√
⌫
AC
7
8
9
+
4
5
6
−
1
2
3
×
0
.
a
b
Check
↵
÷
#11618
All topics
All Information Theory topics