This invention discloses a method for constructing QC-LDPC codes that minimizes the number of short loops, comprising the following steps: Step 1: Randomly generate the initial QC-LDPC code base matrix according to the construction requirements; Step 2: Count the number of short loops passing through each element in the base matrix; Step 3: Sort all elements in the base matrix according to the number of short loops; Step 4: Iterate through each element sequentially, calculate the number of short loops corresponding to all values of the element, select the value with the fewest short loops as the new value of the element, if the element value changes, return to Step 2 for the next round of optimization, otherwise continue to
traverse the next element; Step 5: Replace each element in the base matrix with a CPM (Current Minimum Quantity). This invention performs
global optimization on all elements in the entire matrix, which can approach the
global optimum solution, and does not rely on mathematical theories such as finite fields, has no restrictions on parameters, and has great flexibility.