A construction for low density parity check convolutional codes based on quasi-cyclic block codes

IEEE International Symposium on Information Theory-Proceedings

Volumn , Issue , 2002, Pages 481-

  Sridharan, Arvind ^a   Costello, Daniel J ^a   Sridhara, Deepak ^a   Fuja, Thomas E ^a   Tanner, R Michael ^b  

^a UNIVERSITY OF NOTRE DAME   (United States)

^b University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUASI-CYCLIC BLOCK CODES;

BLOCK CODES; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; DECODING; GRAPH THEORY; MATRIX ALGEBRA; MAXIMUM LIKELIHOOD ESTIMATION; POLYNOMIALS;

CONVOLUTIONAL CODES;

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

References (4)

1. A [155,64,20] sparse graph (LDPC) code
2. Low density parity check matrices from permutation matrices
3. Time-varying periodic convolutional codes with low-density parity-check matrix