Iterative decoding of one-step majority logic decodable codes based on belief propagation

IEEE Transactions on Communications

Volumn 48, Issue 6, 2000, Pages 931-937

  Lucas, Rainer ^a   Fossorier, Marc P C ^b   Kou, Yu ^b,c   Lin, Shu ^b,c  

^a SIEMENS AG   (Germany)

^b University of Hawaii at Manoa   (United States)

^c University of California Davis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; DECODING; ITERATIVE METHODS;

BELIEF-PROPAGATION DECODING; LOW-DENSITY PARITY CHECK (LDPC) CODES; ONE-STEP MAJORITY LOGIC DECODABLE (OSMLD) CODES; SOFT-DECISION DECODING;

SIGNAL ENCODING;

EID: 0034206426     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.848552     Document Type: Article

References (17)

1. J. E. Massey, Threshold Decoding. Cambridge, MA: MIT Press, 1963.
2. R. GallagerEow density parity-check codes IEEE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1968.
3. R. Eucas, M. Bossert, and M. BreitbachOn iterative soft-decision decoding of linear binary block codes and product codes IEEE J. Select. Areas Commun., vol. 16, pp. 276-296, Feb. 1998.
4. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann, 1988.
5. N. WibergCodes and decoding on general graphs Ph.D. dissertation, Einköping Univ., Einköping, Sweden, 1996.
6. R. J. McEliece, D. J. C. MacKay, and J.-F. ChengTurbo decoding as an instance of Pearl's 'Belief Propagation' algorithm IEEE J. Select. Areas Commun., vol. 16, pp. 140-152, Feb. 1998.
7. D. J. C. MacKayGood error-correcting codes based on very sparse matrices lEEETrans. Inform. Theory, vol. 45, pp. 399-432, Mar. 1999.
8. M. Fossorier, M. Mihaljevic, and H. ImaiReduced complexity iterative decoding of low density parity check codes based on belief propagation IEEE Trans. Commun., vol. 47, pp. 673-680, May 1999.
9. F. R. Kschischang and B. J. FreyIterative decoding of compound codes by probability propagation in graphical models IEEE J. Select. Areas Commun., vol. 16, pp. 219-230, Feb. 1998.
10. R. M. TannerA recursive approach to low complexity codes IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
11. M. Fossorier and S. EinSoft-decision decoding of linear block codes based on ordered statistics IEEE Trans. Inform. Theory, vol. 41, pp. 1379-1396, Sept. 1995.
12. S. Ein and D. J. Costello, Error Control Coding, Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
13. E. D. RudolphGeometric configuration and majority logic decodable codes M.E.E. thesis, Univ. of Oklahoma, Norman, OK, 1964.
14. E. J. WeldonDifference-set cyclic codes Bell Syst. Tech. J., vol. 45, pp. 1045-1055, Sept. 1966.
15. C. R. P. Hartmann and E. D. RudolphAn optimum symbol-by-symbol decoding rule for linear codes IEEE Trans. Inform. Theory, vol. IT-22, pp. 514-517, Sept. 1976.
16. G. Battail, M. C. Decouvelaere, and P. GodlewskiReplication decoding IEEE Trans. Inform. Theory, vol. IT-25, pp. 332-345, May 1979.
17. R. Tanner and D. J. C. MacKay, private communication, Dec. 1998.