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 - researchr publication

researchr

You are not signed in
Sign in
Sign up

Ali Dehghan 0001, Amir H. Banihashemi. 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. In 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17-22, 2018. pages 1640-1644, IEEE, 2018. [doi]

Abstract is missing.

runs on WebDSL