• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes.

Ali DehghanAmir H. Banihashemi
Published in: ISIT (2018)
Keyphrases
  • upper bound
  • minimum distance
  • lower bound
  • ldpc codes
  • image processing
  • worst case
  • computer vision
  • optimal solution