Irregular Repeat Accumulate Codes (2000)
| Citations: | 73 - 1 self |
BibTeX
@MISC{Jin00irregularrepeat,
author = {Hui Jin and Aamod Khandekar and Aamod Kh and Robert J. McEliece},
title = {Irregular Repeat Accumulate Codes},
year = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we will introduce an ensemble of codes called irregular repeat-accumulate (IRA) codes. IRA codes are a generalization of the repeat-accumulate codes introduced in [1], and as such have a natural linear time encoding algorithm. We shall prove that on the binary erasure channel, IRA codes can be decoded reliably in linear time, using iterater] sum-product decoding,a# ra#SJ a#SJ8T a#SJ8 close tocha#T36 ca pa#J464 Asimila# resulta#u ea#S to be true on the AWGN channel, although we have no proof of this. We illustrate our results with numerical and experimenta# examples.
Citations
| 328 | Iterative decoding of binary block and convolutional codes - Offer, Papke - 1996 |
| 221 | The capacity of low-density parity-check codes under message-passing decoding - Richardson, Urbanke - 2001 |
| 199 | Practical loss-resilient codes - Luby, Mitzenmacher, et al. - 1997 |
| 110 | Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation - Chung, Richardson, et al. - 2001 |
| 105 | Coding theorems for “turbo-like” codes - Divsalar, Jin, et al. - 1998 |
| 45 | New Sequences of Linear Time Erasure Codes approaching the Channel Capacity - Shokrollahi - 1999 |
| 15 | Design of provably good low-density parity-check codes - Richardson, Shokrollahi, et al. - 2001 |
| 9 | Analysis of low-density codes and improved designs using irregular graphs - Luby, Mitzenmacher, et al. - 1998 |
| 6 | Iterative turbo decoder analysis based on Gaussian density evolution,” submitted to - Divsalar, Dolinar, et al. - 2000 |
| 3 | Codes and decoding on general graphs,” dissertation no - Wiberg - 1996 |
