Low-density parity-check codes based on finite geometries: A rediscovery and new results

IEEE Transactions on Information Theory

Volumn 47, Issue 7, 2001, Pages 2711-2736

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

^a IEEE   (United States)

^b University of California Davis   (United States)

^c University of Hawaii at Manoa   (United States)

Author keywords

Bit flipping decoding; Column splitting; Cyclic code; Euclidean geometry; Iterative decoding; Low density parity check (LDPC) codes; Projective geometry; Quasi cyclic code; Row splitting; Shortening

Indexed keywords

LOW-DENSITY PARITY-CHECK (LDPC) CODES;

ALGORITHMS; COMPUTER SIMULATION; DECODING; GEOMETRY; ITERATIVE METHODS; SHIFT REGISTERS; TURBO CODES;

BINARY CODES;

EID: 0035504019     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.959255     Document Type: Article

References (53)

1. Low density parity check codes
2. A recursive approach to low complexity codes
3. Near Shannon limit performance of low density parity check codes
4. Expander codes
5. Linear-time encodable error-correcting codes
6. Low density parity check codes over GF (q)
7. Improved low-density parity-check codes using irregular graphs and belief propagation
8. Gallager codes that are better than turbo codes
9. Good error-correcting codes based on very sparse matrices
10. Design of capacity-approaching irregular codes
11. The capacity of low-density parity-check codes under message-passing decoding
12. Low density parity check codes based on finite geometries: A rediscovery
13. Construction of low density parity check codes: A geometric approach
14. Local computations with probabilities on graphical structures and their application to expert systems
15. Codes and iterative decoding on general graphs
16. Turbo decoding as an instance of Pearl's belief propagation algorithm
17. Iterative decoding of compound Codes by probability propagation in general models
18. Factor graphs and the sum-product algorithm
19. Reduced complexity iterative decoding of low density parity check codes
20. Iterative decoding of one-step majority logic decodable codes based on belief propagation
21. Near Shannon limit error-correcting coding and decoding: Turbo codes
22. Near optimum error correcting coding and decoding: Turbo-codes
23. Unveiling turbo codes: Some results on parallel concatenated coding schemes
24. Iterative decoding of binary block and convolutional codes
25. On a class of error correcting binary group codes
26. Which codes have cycle-free Tanner graphs
27. Codes on graphs: Normal realizations
28. Euclidean geometry cyclic codes
29. Polynomial codes
30. On a class of cyclic codes
31. On the number of information symbols in polynomial codes
32. On majority-logic decoding for duals of primitive polynomial codes
33. New generations of the Reed-Muller codes, Part II: Non-primitive codes
34. A class of majority logic decodable codes
35. Difference-set cyclic codes
36. On the number of parity checks in difference-set cyclic codes
37. A class of multiple-error-correcting codes and the decoding scheme
38. Probability decoding of majority codes
39. Optimal decoding of linear codes for minimizing symbol error rate
40. On iterative soft-decision decoding of linear block codes and product codes