1. Tanner, R.M., On Quasi-cyclic Repeat-Accumulate Codes, in Proc. 37th Allerton Conf. on Communication, Control and Computing, Monticello, IL, USA, Sept. 22–24, 1999, pp. 249–259.
2. Fossorier, M.P.C., Quasi-cyclic Low-Density Parity-Check Codes from Circulant Permutation Matrices, IEEE Trans. Inform. Theory, 2004, vol. 50, no. 8, pp. 1788–1793.
3. Fan, J.L., Array Codes as Low-Density Parity-Check Codes, in Proc. 2nd Int. Symp. on Turbo Codes and Related Topics, Brest, France, Sept. 4–7, 2000, pp. 543–546.
4. Richardson, T.J., Shokrollahi, M.A., and Urbanke, R.L., Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes, IEEE Trans. Inform. Theory, 2001, vol. 47, no. 2, pp. 619–637.
5. Li, Z., Chen, L., Zeng, L., Lin, S., and Fong, W.H., Efficient Encoding of Quasi-cyclic Low-Density Parity-Check Codes, IEEE Trans. Commun., 2006, vol. 54, no. 1, pp. 71–81.