On achievable rates and complexity of LDPC codes for parallel channels: Information-theoretic bounds and applications

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 406-410

  Sason, Igal ^a   Wiechman, Gil ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING COMPLEXITY; LOW-DENSITY PARITY-CHECK (LDPC) CODES; PARALLEL CHANNELS;

COMPUTATIONAL COMPLEXITY; DECODING; PARALLEL PROCESSING SYSTEMS; STATISTICAL METHODS; THEOREM PROVING;

CHANNEL CODING;

EID: 39049151336     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261700     Document Type: Conference Paper

References (11)

1. D. Burshtein, M. Krivelevich, S. Litsyn and G. Miller, "Upper bounds on the rate of LDPC codes," IEEE Trans. on Information Theory, vol. 48, no. 9, pp. 2437-2449, September 2002.
2. Y. Liu, J. Hou and V. K. N. Lau, "Complexity Bounds of LDPC codes for parallel channels," Proceedings Forty-Second Annual Allerton Conference on Communication, Control and Computing, pp. 1705-1713, IL, USA, September 2004.
3. J. Ha and S. W. McLaughlin, "Rate-compatible puncturing of low-density parity-check codes," IEEE Trans. on Information Theory, vol. 50, no. 11, pp. 2824-2836, November 2004.
4. V. Nagarajan, Y. Liu and J. Hou, "Joint design of LDPC codes for parallel channels and its applications,"Proceedings of the Forty-First Annual Allerton Conference on Communication, Control and Computing, pp. 1704-1705, Urbana-Champaign, IL, USA, October 2003.
5. H. D. Pfister, I. Sason and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity," IEEE Trans. on Information Theory, vol. 51, no. 7, pp. 2352-2379, July 2005.
6. H. Pishro-Nik, N. Rahnavard and F. Fekri, "Nonuniform error correction using low-density parity-check codes," IEEE Trans. on Information Theory, vol. 51, no. 7, pp. 2702-2714, July 2005.
7. H. Pishro-Nik and F. Fekri, "Results on punctured LDPC codes," Proceedings 2004 IEEE Information Theory Workshop (ITW 2004), PP. 215-219, San Antonio, Texas, USA, October 24-29, 2004.
8. H. Pishro-Nik and F. Fekri, "On decoding of low-density paritycheck codes over the binary erasure channel," IEEE Trans. on Information Theory, vol. 50, pp. 439-454, March 2004.
9. I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channels," IEEE Trans. on Information Theory, vol. 49, no. 7, pp. 1611-1635, July 2003.
10. I. Sason and G. Wiechman, "On achievable rates and complexity of LDPC codes for parallel channels with application to puncturing," submitted to IEEE Trans. on Information Theory, August 2005. See http://arxiv.org/abs/cs. IT/0508072.
11. G. Wiechman and I. Sason, "Improved bounds on the paritycheck density and achievable rates of binary linear block codes with applications to LDPC codes," submitted to IEEE Trans. on Information Theory, May 2005. [Online]. Available: http://arxiv.org/abs/cs.IT/0505057.