Bounds on information combining for parity-check equations

International Zurich Seminar on Digital Communications

Volumn , Issue , 2004, Pages 68-71

  Land, Ingmar ^a   Hoeher, Peter A ^a   Huber, Johannes ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; CHANNEL CAPACITY; COMPUTER SIMULATION; CONSTRAINT THEORY; DATA STORAGE EQUIPMENT; ERROR CORRECTION;

BINARY ERASURE CHANNELS; MEMORYLESS CHANNELS; MUTUAL INFORMATION; PARITY-CHECK EQUATIONS;

INFORMATION RETRIEVAL;

EID: 2442556258     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. 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.
2. C. Berrou and A. Glavieux, 'Near optimum error correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., vol. 44, no. 10, pp. 1261-1271, Oct. 1996.
3. S. Benedetto and G. Montorsi, 'Unveiling turbo codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inform. Theory, vol. 42, no. 2, pp. 409-428, Mar. 1996.
4. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, 'Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding," IEEE Trans. Inform. Theory, vol. 44, no. 3, pp. 909-926, May 1998.
5. R. Gallager, 'Low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 8, no. 1, pp. 21-28, Jan. 1962.
6. D. J. MacKay, 'Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
7. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, no. 5, pp. 533 -547, Sept. 1981.
8. N. Wiberg, H.-A. Loeliger, and R. Koetter, 'Codes and iterative decoding on general graphs," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Sept. 1995, p. 468.
9. F. Kschischang, B. Frey, and H.-A. Loeliger, 'Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
10. S. Huettinger, J. Huber, R. Johannesson, and R. Fischer, 'Information processing in soft-output decoding," in Proc. Allerton Conf. on Communications, Control, and Computing, Monticello, Illinois, USA, Oct. 2001.
11. S. Huettinger, J. Huber, R. Fischer, and R. Johannesson, 'Soft-output-decoding: Some aspects from information theory," in Proc. Int. ITG Conf. on Source and Channel Coding, Berlin, Germany, Jan. 2002, pp. 81-90.
12. I. Land, S. Huettinger, P. A. Hoeher, and J. Huber, 'Bounds on information combining," in Proc. Int. Symp. on Turbo Codes & Rel. Topics, Brest, France, Sept. 2003, pp. 39-42.
13. J. Hagenauer, E. Offer, and L. Papke, 'Iterative decoding of binary block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, no. 2, pp. 429-445, Mar. 1996.
14. S. ten Brink, 'Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
15. A. D. Wyner and J. Ziv, 'A theorem on the entropy of certain binary sequences and applications: Part I" IEEE Trans. Inform. Theory, vol. 19, no. 6, pp. 769-772, Nov. 1973.