Multiple-bases Belief-Propagation for decoding of short block codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 311-315

  Hehn, Thorsten ^a   Huber, Johannes B ^a   Laendner, Stefan ^b   Milenkovic, Olgica ^b  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

^b University of Colorado   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODING; DATA DELAYS; INTERNATIONAL SYMPOSIUM;

BACKPROPAGATION; BLOCK CODES; BOOLEAN FUNCTIONS; CODES (SYMBOLS); CYBERNETICS; DATA PROCESSING; INFORMATION THEORY; MAXIMUM LIKELIHOOD; TECHNICAL PRESENTATIONS;

DECODING;

EID: 51649101856     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557244     Document Type: Conference Paper

References (16)

1. S. Lin and D.J. Costello. Error Control Coding. Pearson Education, Inc., Second edition, 2004.
2. J. Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann Publishers, 1986.
3. C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit error-correcting coding and decoding. In Proc. Int. Communications Conf., 1993.
4. T. Richardson. Error-floors of LDPC codes. In Proceedings of the 41st Annual Allerton Conference on Communication, Control and Computing, pages 1426-1435, Sept. 2003.
5. R. M. Pyndiah. Near-optimum decoding of product codes: Block turbo codes. IEEE Trans. on Comm., 46(8): 1003-1010, August 1998.
6. T.R. Halford, K.M. Chugg, and A.J. Grant. Which codes have 4-cycle-free tanner graphs? In Proceedings of Int. Symp. on Inform. Theory (ISIT), pages 871-875, Seattle, WA, July 2006.
7. M.P.C. Fossorier and S. Lin. Soft-decision decoding of linear block codes based on ordered statistics. IEEE Trans. Inform. Theory, 41:1379-1396, September 1995.
8. T.R. Halford and K.M. Chugg. Random redundant soft-in soft-out decoding of linear block codes. In Proceedings of Int. Symp. on Inform. Theory (ISIT), pages 2230-2234, Seattle, WA, July 2006.
9. A. Kothiyal, O. Y. Takeshita, W. Jin, and M.P.C. Fossorier. Iterative reliability-based decoding of linear block codes with adaptive belief propagation. IEEE Communications Letters, 9(12): 1067-1069, December 2005.
10. J. Jiang and K.R. Narayanan. Iterative soft decision decoding of reed solomon codes based on adaptive parity check matrices. In Proc. IEEE Int. Symp. on Inform. Theory, page 261, 2004.
11. M. Schwartz and A. Vardy. On the stopping distance and stopping redundancy of codes. IEEE Trans. on Inform. Theory, 52(3):922-932, March 2006.
12. J. Han and P. Siegel. Improved upper bounds on stopping redundancy. IEEE Trans. on Inform. Theory, 53(1):90-104, January 2007.
13. T. Hehn, S. Laendner, O. Milenkovic, and J. B. Huber. The stopping redundancy hierarchy of cyclic codes. In Proceedings of the 44th Annual Allerton Conference on Communication, Control and Computing, 2006.
14. T. Hehn, O. Milenkovic, S. Laendner, and J.B. Huber. Permutation decoding and the stopping redundancy hierarchy of linear block codes. Accepted for presentation at IEEE Int. Symp. on Inform. Theory (ISIT 2007), Nice, France, June 2007.
15. F.J. MacWilliams and N.J. Sloane. The Theory of Error-Correcting Codes. North-Holland Publishing Company, 1977.
16. J.L. Wolf. Efficient maximum likelihood decoding of linear block codes using a trellis. IEEE Trans. on Inform. Theory, 24:76-80, 1978.