We construct a 71 × 142 parity-check matrix by first forming a binary matrix with the help of the progressive edge-growth [12] algorithm and then replacing the 1 s by the randomly chosen elements from GF
We construct a 71 × 142 parity-check matrix by first forminga binary matrix with the help of the progressive edge-growth[12] algorithm and then replacing the 1 s by the randomlychosen elements from GF