1 citations · 1 across the 1 of their papers we have counts for
1 paper
Igal Sason, Gil Wiechman
This paper provides simple lower bounds on the number of iterations which is required for successful message-passing decoding of some important families of graph-based code ensembl…