Codes for iterative decoding from partial geometries

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 310-

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

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE DECODING;

ALGORITHMS; CODES (SYMBOLS); EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS; MATRIX ALGEBRA; THEOREM PROVING;

DECODING;

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

References (4)

1. On the p-rank of strongly regular graphs
2. Low-density paritycheek codes based on finite geometries: A rediscovery and new results
3. Minimum distance bounds by graph analysis
4. Construction of codes based on finite generalized quadrangles for iterative decoding