Construction of low-density parity-check codes from Kirkman triple systems

Conference Record / IEEE Global Telecommunications Conference

Volumn 2, Issue , 2001, Pages 970-974

  Johnson, Sarah J ^a   Weller, Steven R ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONSTRAINT THEORY; MATRIX ALGEBRA;

LOW-DENSITY PARITY-CHECK (LDPC) CODES;

CODES (SYMBOLS);

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

References (23)

1. Low-density parity-check codes
2. Near Shannon limit performance of low density parity check codes
3. A recursive approach to low complexity codes
4. Low density parity check codes
5. Efficient encoding of low-density parity-check codes
6. Good error-correcting codes based on very sparse matrices
7. Iterative decoding of one-step majority logic decodable codes based on belief propagation
8. Turbo decoding as an instance of Pearl's "belief propagation" algorithm
9. Which codes have cycle-free tanner graphs?
10. Gallager codes for CDMA applications-Part I: Generalizations, constructions, and performance bounds
11. Evaluation of Gallager codes for short block length and high rate applications
12. Solution of Kirkmans school-girl problem
13. On 2-ranks of Steiner triple systems
14. On the number of information symbols in polynomial codes
15. Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis
16. Evaluation of Gallager codes for short block length and high rate applications
17. Construction techniques for anti-Pasch Steiner triple systems
18. The resolution of the anti-Pasch conjecture
19. Low density parity check codes: Construction based on finite geometries