A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols

  • Authors:
  • Ivana Djurdjevic;Jun Xu;Khaled Abdel-Ghaffar;Shu Lin

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of California, Davis, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, Davis, CA

  • Venue:
  • AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an algebraic method for constructing regular low-density parity-check (LDPC) codes based on Reed-Solomon codes with two information symbols. The construction method results in a class of LDPC codes in Gallager's original form. Codes in this class are free of cycles of length 4 in their Tanner graphs and have good minimum distances. They perform well with iterative decoding.