Investigation of circulant matrices for reversible LDPC codes

We investigate the error performance of reversible LDPC codes constructed from the circulant matrix (Haley, D. et al., IEEE Global Telecom. Conf., vol.1, p.1303-7, 2002) in the region of BER smaller than 10/sup -5/. We also propose and investigate other possible circulant matrices selected from some primitive polynomials over GF(2). We expect to offer another choice of block length and in some cases better error performance for reversible LDPC codes.