Design considerations leading to the development of good /spl pi/-rotation LDPC codes

In this letter we present two theoretical results that lead to the development of good /spl pi/-rotation LDPC codes. The first theorem derives bounds on the weight of the parity vector when the weight of the information vector is two. The second theorem establishes the expected number of short-loops in the parity check matrix. Several performance examples are given.