|
[1] R. Gallager, “Low-density parity-check codes,” IRE Transactions on Information The- ory, vol. 8, pp. 21–28, January 1962. [2] R. Townsend and E. Weldon, “Self-orthogonal quasi-cyclic codes,” IEEE Transactions on Information Theory, vol. 13, pp. 183–195, April 1967. [3] Y. Kou, S. Lin, and M. Fossorier, “Low-density parity-check codes based on finite geometries: a rediscovery and new results,” IEEE Transactions on Information Theory, vol. 47, pp. 2711–2736, Nov 2001. [4] M. Fossorier, “Quasicyclic low-density parity-check codes from circulant permutation matrices,” IEEE Transactions on Information Theory, vol. 50, pp. 1788–1793, Aug 2004. [5] R. Sobhani, “Approach to the construction of regular low-density parity-check codes from group permutation matrices,” IET Communications, vol. 6, pp. 1750–1756, August 2012. [6] X.-Y. Hu, E. Eleftheriou, and D. Arnold, “Regular and irregular progressive edge-growth tanner graphs,” IEEE Transactions on Information Theory, vol. 51, pp. 386–398, Jan 2005. [7] T. Richardson and R. Urbanke, “Efficient encoding of low-density parity-check codes,” IEEE Transactions on Information Theory, vol. 47, pp. 638–656, Feb 2001. 26[8] Z. Li and B. Kumar, “A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph,” vol. 2, pp. 1990–1994 Vol.2, Nov 2004. [9] P. Prompakdee, W. Phakphisut, and P. Supnithi, “Quasi cyclic-ldpc codes based on peg algorithm with maximized girth property,” pp. 1–4, Dec 2011. [10] M. Fossorier, “Quasicyclic low-density parity-check codes from circulant permutation matrices,” IEEE Transactions on Information Theory, vol. 50, pp. 1788–1793, Aug 2004. |