High-rate low-density parity check codes based on anti-Pasch affine geometries

IEEE International Conference on Communications

Volumn 3, Issue , 2002, Pages 1332-1336

  Vasic, Bane ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; COMBINATORIAL MATHEMATICS; DECODING; MATRIX ALGEBRA;

PARITY CHECK CODES;

BINARY CODES;

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

References (24)

1. Construction of (q,k,l) difference families with q a prime power and k=4,5
2. Steiner systems
3. Construction techniques for anti-pasch Steiner triple systems
4. Iterative decoding of compound codes by probability propagation in graphical models
5. Low density parity check codes based on finite geometries: A rediscovery and new results
6. Good codes based on very sparse matrices
7. Good error-correcting codes based on very sparse matrices
8. Turbo decoding as an instance of Pearl's 'Belief Propagation' algorithm
9. Zur theorie der triplesysteme
10. Design of provably good low-density parity check codes
11. A mathematical theory of communication
12. A recursive approach to low complexity codes
13. Structured iteratively decodable codes based on Steiner systems and their application in magnetic recording
14. Codes and iterative decoding on general graphs
15. Iterative decoding of one-step majority logic decodable codes based on belief propagation
16. Regular low-density parity-check codes from combinatorial designs