Hybrid LDPC codes and iterative decoding methods - i3s

ensea.fr

Hybrid LDPC codes and iterative decoding methods - i3s

138 BIBLIOGRAPHY

[12] C. Berrou and A. Glavieux, “Near optimum error correcting coding and decoding:

turbo-codes,” IEEE Transactions on Communications, vol. 44, no. 10, pp. 1261–

1271, October 1996.

[13] J. Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference.

Morgan Kaufmann, 1988.

[14] S. ten Brink, “Convergence behavior of iteratively decoded parallel concatenated

codes,” IEEE Transactions on Communications, vol. 49, no. 10, pp. 1727–1737,

October 2001.

[15] S. Y. Chung, G. D. Forney, T. J. Richardson, and R. Urbanke, “On the design

of low-density parity-check codes within 0.0045 db of the shannon limit,” IEEE

Communications Letters, vol. 5, pp. 58–60, February 2001.

[16] K. Price and R. Storn, “Differential evolution - a simple and efficient

heuristic for global optimization over continuous spaces,” Journal

on Global Optimization, vol. 11, pp. 341–359, 1997, code available at:

http://www.icsi.berkeley.edu/ storn/code.html.

[17] P. Oswald and M. A. Shokrollahi, “Capacity-achieving sequences for the erasure

channel,” IEEE Transactions on Information Theory, vol. 48, pp. 364–373, December

2002.

[18] T. Etzion, A. Trachtenberg, and A. Vardy, “Which codes have cycle-free tanner

graphs?” IEEE Transactions on Information Theory, vol. 45, no. 6, pp. 2173–2181,

1999.

[19] P. O. Vontobel and R. Koetter, “Graph-cover decoding and finite-length

analysis of message-passing iterative decoding of LDPC codes,” accepted

for IEEE Tansactions on Information Theory, 2007, available at:

http://arxiv.org/abs/cs.IT/0512078/.

[20] V. Chernyak, M. Chertkov, M. Stepanov, and B. Vasic, “Error correction on a tree:

An instanton approach,” Physical Review Letters, vol. 93, no. 19, p. 198, November

2004.

[21] M. Chiani and A. Ventura, “Design and performance evaluation of some high-rate

irregular low-density parity-check codes,” in Proceedings of IEEE Global Telecommunications

Conference, San Antonio, USA, November 2001.

[22] C. Di, R. Urbanke, and T. Richardson, “Weight distribution of low-density paritycheck

codes,” IEEE Transactions on Information Theory, vol. 52, no. 11, pp. 4839–

4855, November 2006.

[23] X.-Y. Hu, E. Eleftheriou, and D. Arnold, “Regular and irregular progressive edgegrowth

Tanner graphs,” IEEE Transactions on Information Theory, vol. 51, pp.

386–398, January 2005.

More magazines by this user
Similar magazines