Login / Signup

Minimum distance computation of LDPC codes using a branch and cut algorithm.

Ahmet B. KehaTolga M. Duman
Published in: IEEE Trans. Commun. (2010)
Keyphrases
  • minimum distance
  • optimal solution
  • computational complexity
  • search space
  • expectation maximization
  • single pass
  • feature selection
  • similarity measure
  • np hard
  • probabilistic model
  • objective function
  • convex hull