Finite-length analysis of a capacity-achieving ensemble for the binary erasure channel

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005

Volumn , Issue , 2005, Pages 166-170

  Pfister, Henry D ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER SIMULATION; DECODING; ITERATIVE METHODS; NUMERICAL METHODS;

BIT-REGULAR ENSEMBLES; BOUNDED COMPLEXITY; FINITE-LENGTH ANALYSIS; IRREGULAR REPEAT-ACCUMULATE (IRA);

CHANNEL CAPACITY;

EID: 33749053876     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2005.1531880     Document Type: Conference Paper

References (12)

1. A. Amraoui, A. Montanari, T. Richardson, and R. Urbanke. Finite-length scaling for iteratively decoded LDPC ensembles, submitted to IEEE Trans. on Inform. Theory.
2. A. Amraoui, A. Montanari, and R. Urbanke. Finite-length scaling of irregular LDPC code ensembles. In Proc. IEEE Inform. Theory Workshop, New Zealand, Sept. 2005.
3. C. Di, D. Proietti, E. Telatar, T. J. Richardson, and R. Urbanke. Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. Inform. Theory, 48(6): 1570-1579, June 2002.
4. H. Jin, A. Khandekar, and R. J. McEliece. Irregular repeat-accumulate codes. In Proc. Int. Symp. on Turbo Codes & Related Topics, Brest, France, Sept. 2000.
5. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman. Efficient erasure correcting codes. IEEE Trans. Inform. Theory, 47(2): 569-584, Feb. 2001.
6. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann. Practical loss-resilient codes. In Proc. of the 29th Annual ACM Symp. on Theory of Comp., pages 150-159, 1997.
7. P. Oswald and M. A. Shokrollahi. Capacity-achieving sequences for the erasure channel. IEEE Trans. Inform. Theory, 48(12):3017-3028, Dec. 2002.
8. H. D. Pfister and I. Sason. Accumulate-repeat-accumulate codes: Systematic codes achieving the binary erasure channel capacity with bounded complexity, to be submitted to IEEE Trans. on Inform. Theory.
9. H. D. Pfister, I. Sason, and R. Urbanke. Capacity-achieving ensembles for the binary erasure channel with bounded complexity. IEEE Trans. Inform. Theory, 51(7):2352-2379, July 2005.
10. T. J. Richardson and R. L. Urbanke. The capacity of low-density parity check codes under message-passing decoding. IEEE Trans. Inform. Theory, 47(2):599-618, Feb. 2001.
11. I. Sason and R. Urbanke. Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel. IEEE Trans. Inform. Theory, 50(6): 1247-1256, June 2004.
12. M. A. Shokrollahi. New sequences of linear time erasure codes approaching the channel capacity. In Applicable Algebra in Eng., Commun. Comp., pages 65-76, 1999.