Stopping sets and the girth of tanner graphs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 2-

  Orlitsky, Alon ^a   Urbanke, R ^b   Viswanathan, K ^a   Zhang, J ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

STOPPING SETS; TANNER GRAPHS;

ERROR ANALYSIS; GRAPH THEORY; ITERATIVE METHODS; PROBABILITY; SET THEORY;

CODES (SYMBOLS);

EID: 0036354005     PISSN: 21578095     EISSN: None     Source Type: Journal    
DOI: 10.1109/ISIT.2002.1023274     Document Type: Article

References (3)

1. A recursive approach to low-complexity codes
2. Finite length analysis of low-density parity-check codes