Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes

In this letter, we obtain lower and upper bounds on the minimum distance d
_min
of low-density parity-check (LDPC) codes. The bounds are derived by categorizing the non-zero code words of an LDPC code into two categories of elementary and non-elementary. The first category contains code words whose induced subgraph has only degree-2 check nodes. We propose an efficient search algorithm that can find the elementary code words of an LDPC code with weight less than a certain value a
_max
, exhaustively. We also derive a lower bound L
_ne
on the weight of non-elementary code words. By performing the search with a
_max
= L
_ne
, we either obtain an elementary code word with the smallest weight dmin, or establish the lower bound of L
_ne
on d
_min
. For the upper bound, we modify our search algorithm to reach elementary codewords of larger weights at the cost of being non-exhaustive. Once such a codeword is found, its weight acts as an upper bound on d
_min
. We examine a large number of regular and irregular LDPC codes, and demonstrate the efficiency and versatility of our technique in finding lower and upper bounds on, and in many cases the exact value of, d
_min
. Finding d
_min
, or establishing search-based lower or upper bounds, for many of the examined codes are out of the reach of any existing algorithm.