1 |
T. J. Richardson, A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, Vol.47, No.2, pp.619-637, Feb. 2001.
DOI
ScienceOn
|
2 |
L. Ping and K. Y. Wu, "Concatenated tree codes: a low-complexity, high-performance approach," IEEE Trans. Inform. Theory, Vol.47, No.2, pp.791-799, Feb. 2001.
DOI
ScienceOn
|
3 |
L. Ping, X. L. Huang, and N. Phamdo, "Zigzag codes and concatenated zigzag codes," IEEE Trans. Inform. Theory, Vol.47, No.2, pp.800-807, Feb. 2001.
DOI
ScienceOn
|
4 |
C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc.ICC'93, pp.1064-1070.
|
5 |
R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, pp.21-28, Jan. 1962.
|
6 |
H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," Proc. 2nd Intern. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2000.
|
7 |
J. Sun and O. Y. Takeshita, "Interleavers for Turbo codes using permutation polynomials over integer rings," IEEE Trans. Inform. Theory, Vol.51, No.1, pp. 101-119, Jan. 2005.
DOI
ScienceOn
|
8 |
T. J. Richardson and R. L. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inform. Theory, Vol.47, No.2, pp.638-656, Feb. 2001.
DOI
ScienceOn
|
9 |
L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, pp.284-287, Mar. 1974.
|
10 |
S.-N. Hong and D.-J. Shin, "Optimal rate-compatible punctured concatenated zigzag codes," in Proc. ICC'05, May 2005, pp.627-631.
|
11 |
D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," IEEE Electon. Lett., pp.1645-1646, Aug. 1996.
|