In this paper, a simple cooperative diversity scheme in M + 2 relay network with low-density parity-check (LDPC) codes is proposed. By allocating random interleavers to each relay node, the interleaved sequences provide M copies of received vector to achieve the cooperative diversity. An efficiently iterative coding algorithm is proposed with low complexity. The complexity involved grows linearly with the number of relay nodes and size of Galois Field.