Design of non binary LDPC codes using their binary image: algebraic properties

In this paper, we develop algebraic properties of regular (2, t
_r
, N) non binary LDPC codes designed using their binary image. First, we characterize the algebraic properties of optimized rows of the parity check matrix H associated with a code, and then we study the algebraic properties of cycles and stopping sets associated with the underlaying Tanner graph