Sign in

Girth Analysis of Tanner's (3, 17)-Regular QC-LDPC Codes Based on Euclidean Division Algorithm.

Hengzhou XuYake DuanXiaoxiao MiaoHai Zhu
Published in: IEEE Access (2019)
Keyphrases
  • dynamic programming
  • computational complexity
  • np hard
  • search space
  • expectation maximization
  • optimal solution
  • image quality
  • graph cuts
  • information theoretic
  • non binary