REFERENCES
- J Hagenauer, Rate-compatible punctured convolutional codes (rcpc codes) and their applications, IEEE Trans. Commun, pp 389–400, April 1988.
- Z Lin & A Svensson, New rate-compatible repetition convolutional codes, IEEE Trans. Info. Theory, pp 2651–2657, November 2000.
- AS Barbuiescu & S S Pietrobon, Rate compatible turbo codes. Electron Let, pp 535–536, March 1995.
- D N Rowitch & L B Milstein, On the performance of hybrid fec/arq systems using rate compatible punctured turbo (rcpt) codes, IEEE Trans Commun, pp 55–67, June 2000.
- T Ji & W E Stark, Turbo-coded arq schemes for ds-cdma data networks over fading and shadowing channels: throughput, delay and energy efficiency, IEEEJSele Area Commun, pp 1355–1364, August 2000.
- J Ha & S W McLaughlin, Optimal puncturing distributions for rate-compatible low-density parity-check codes, in Proceedings. IEEE hit Symp on Info Th, pp 233–233, 2003.
- J Li & K R Narayanan, Rate-compatible low density parity check codes for capacity-approaching arq schemes in packet data communications, in Proc of hit Conf on CIIT, US Virgin Islands, pp 201–206, 2002.
- M R Yazdani & A H Banihashemi, On construction of rate-compatible low-density parity-check codes, IEEE Communications Letters, vol 8, pp 159–161, March 2004.
- R G Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
- T J Richardson & R Urbanke, The capacity of low-density parity-check codes under message-passing decoding, IEEE Trans on Info Theory, vol 47, pp 599–618, February 2001.
- S Y Chung, R Urbanke, & T J Richardson, Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation, IEEE Trans on Info Theory, vol 47, pp 657–670, February 2001.
- S Y Chung, D G F Jr, R Urbanke, & T J Richardson, Low-density parity-check codes within 0.0045 db of the Shannon limit, IEEE Communications Letters, vol 5, pp 58–60, February 2001.
- J Campello & D S Modha, Extended bit-filling and Idpc code design, in IEEE GLOBECOM 2001, pp 985–989, 2001.
- X Y Hu, E Eleftheriou, & D M Arnold, Progressive edge-growth tanner graphs, in IEEE GLOBECOM 2001, pp 995–1001, 2001.
- T J Richardson, A Shokrollahi, & R Urbanke, Design of capacity-approaching irregular low-density parity-check codes, IEEE Trans on Info Theory, vol 47, pp 619–637, February 2001.
- S Y Chung, On the Construction of Some Capacity—Approaching Coding Schemes. PhD thesis. Mass Inst Technol, Cambridge, MA, 2000.
- J Ha & SW McLaughlin, Optimal puncturing of irregular low-density parity-check codes, in IEEE ICC '03, pp. 3110–3114, 2003.
- J Ha & S W McLaughlin, Low-density parity-check codes over gaussian channels with erasures, IEEE Transactions on Information Theory, vol 49, pp 1801–1809, July 2003.
- C Di, D Proietti, I E Telatar, T J Richardson, & R Urbankc, Finite-length analysis of low-density parity-check codes on the binary erasure channel, IEEE Trans on Info Theory, vol 48, pp 1570–1579, June 2002.