REFERENCES
- R G Gallager, Low-density parity-check codes, MIT Press, Cambridge MA, 1963.
- J S Yedidia & J P Bouchaud, Renormalization group approach to error-correcting codes, Journal of Physics A: Mathematical and General, vol 36, pp 1267–1288, Jan 2003.
- D J C Mackay, Good error-correcting codes based on very sparse matrices, IEEE Trans Inform Theory, vol 45, no 2, pp 399–431, March 1999.
- T J Richardson & R L Urbanke, The capacity of low-density parity-check codes under message-passing decoding, IEEE Trans Inform Theory, vol 47, no 2, pp 599–618, Feb 2001.
- C Di, D Proietti, E Telatar, T Richardson & R Urbanke, Finite-length analysis of low-density parity-check codes on the binary erasure channel, IEEE Trans Inform Theory, vol 48, no 6, pp 1570–1579, June 2002.
- A Kavcic, Xiao Ma & M Mitzenmacher, Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds, Information Theory, IEEE Transactions on, vol 49, no 7, pp 1636–1652, July 2003.
- RM Tanner, A recursive approach to low complexity codes, IEEE Trans Inform Theory, vol IT-27, no 5, pp 533–547, Sep 1981.
- M Luby, M Mitzenmacher, A Shokrollahi, D Spielman & V Stemann, Practical Loss-Resilient Codes, Proc 29th ACM Symp Theory of Computing, El Paso, TX, pp 150–159, May 1997.
- T J Richardson, M A Shokrollahi & R L Urbanke, Design of capacity-approaching parity-check codes, irregular low- density, IEEE Trans Inform Theory, vol 47, no 2, pp 619–637, Feb 2001.