On the effect of parity-check weights in iterative decoding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 101-

  Santhi, Nandakishore ^a   Vardy, Alexander ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DETECTION PROBABILITY; ITERATIVE DECODING; LDPC CODES; PARITY-CHECK WEIGHTS;

ALGORITHMS; BLOCK CODES; CHANNEL CAPACITY; DECODING; ITERATIVE METHODS; MATHEMATICAL MODELS; PROBABILITY; RANDOM ERRORS; SET THEORY;

BINARY CODES;

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

References (3)

1. T. ETZION, A. TRACHTENBERG,and A. VARDY, Which codes have cycle-free Tanner graphs?, IEEE Trans. Inform. Theory, vol.45, pp. 2173-2181, September 1999.
2. R.G. GALLAGER, Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963.
3. I. SASON and R. URBANKE, Parity-check density versus performance of binary linear block codes over memoryless symmetric channels, IEEE Trans. Inform. Theory, vol. 49, pp. 1611-1635, 2003.