[PDF][PDF] Calculation of Girth of Tanner Graph in LDPC Codes
H Dehghani, M Ahmadi, S Alikhani… - Trends in Applied …, 2012 - academia.edu
A ESTRA (" T Ll) HC codes can be described by a bipartite graph called" l'anner graph. The
girth g of the code is the length of the shortest cycle in its Tanner graph. We use the parity
check matrix of code to present a method for existence of cycle of length girth g (ie, g-cycle).
This method give the number of cycles of g-cycles in the Low-density Parity Check (LDPC)
codes.
girth g of the code is the length of the shortest cycle in its Tanner graph. We use the parity
check matrix of code to present a method for existence of cycle of length girth g (ie, g-cycle).
This method give the number of cycles of g-cycles in the Low-density Parity Check (LDPC)
codes.