Login / Signup

Lower Bounds on the Size of Smallest Elementary and Non-Elementary Trapping Sets in Variable-Regular LDPC Codes.

Yoones HashemiAmir H. Banihashemi
Published in: IEEE Commun. Lett. (2017)
Keyphrases
  • lower bound
  • ldpc codes
  • np hard
  • computational complexity
  • decoding algorithm