Login / Signup

An efficient algorithm for finding dominant trapping sets of irregular LDPC codes.

Mehdi KarimiAmir H. Banihashemi
Published in: ISIT (2011)
Keyphrases
  • computational complexity
  • dynamic programming
  • probabilistic model
  • optimal solution
  • expectation maximization
  • ldpc codes