Construction of LDPC codes based on narrow-sense-primitive BCH codes

@article{Yi2005ConstructionOL,
  title={Construction of LDPC codes based on narrow-sense-primitive BCH codes},
  author={Yu Yi and Liu Shaobo and Huang Dawei},
  journal={2005 IEEE 61st Vehicular Technology Conference},
  year={2005},
  volume={3},
  pages={1571-1574 Vol. 3}
}
In this paper, we present an algebraic method for constructing regular low-density parity-check (LDPC) codes based on narrow-sense-primitive BCH codes. The construction method results in a class of high rate LDPC codes in Gallager's original form. Codes in this class are free of cycles of length 4 in their Tanner graph and have good minimum distances. They can perform well with the iterative decoding. Also, proposed algebra LDPC codes can be designed for a new class of irregular codes based on… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

The capacity of low-density paritycheck codes under message-passing decoding

  • T. J. Richardson
  • IEEE Trans. Inform. Theory, vol. 47, Feb..
  • 2001
2 Excerpts

Array codes of low-density parity-check codes

  • J. L. Fan
  • roceeding of 2 International Symposium on Turbo…
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…