An efficient exhaustive low-weight codeword search for structured LDPC codes

Abstract

In this paper, we present an algorithm to find all low-weight codewords in a given quasi-cyclic (QC) low-density parity-check (LDPC) code with a fixed column-weight and girth. The main idea is to view a low-weight codeword as an (a, 0) trapping sets, and then show that each topologically different (a, 0) trapping set can be dissected into smaller trapping sets. The proposed search method relies on the knowledge of possible topologies of such smaller trapping sets present in a code ensemble, which enables an efficient search. Combined with the high-rate QC LDPC code construction which successively adds blocks of permutation matrices, the algorithm ensures that in the code construction procedure all codewords up to a certain weight are avoided, which leads to a code with the desired minimum distance. The algorithm can be also used to determine the multiplicity of the low-weight codewords with different trapping set structure.