Advanced search
Publication Cover
IETE Journal of Research Volume 69, 2023 - Issue 7
Submit an article Journal homepage
36
Views
0
CrossRef citations to date
0
Altmetric
Communications

LDPC Codes Based on Rational Functions

Mohammad Gholami1 Department of Mathematical Sciences, Shahrekord University, 88186-34141, Shahrekord, Iran;2 School of Computer Science, Institute for Research in Fundamental Sciences (IPM), 19538-33511, Tehran, IranORCID Iconhttps://orcid.org/0000-0002-3174-0138View further author information
ORCID Icon &
Akram Nassaj1 Department of Mathematical Sciences, Shahrekord University, 88186-34141, Shahrekord, IranView further author information
Pages 4224-4229 | Published online: 31 Aug 2021

References

  • R. G. Gallager, “Low-density parity-check codes,” IEEE Trans. Inform. Theory, Vol. IT-8, no. 1, pp. 21–28, Jan. 1962.
  • R. M. Tanner, “Arecursive approach to low complexity codes,” IEEE Trans. Inform. Theory, Vol. IT-27, pp. 533–547, Sept 1981.
  • F. R. Kschischang, B. J. Frey and H. A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Trans. Inform. Theory, Vol. 47, no. 2, pp. 498–519, Feb. 2001.
  • D. J. C. MacKay and R. M. Neal, “Near Shannon limit performance of low density parity-check code,” IEEE Electron. Lett., Vol. 32, no. 18, pp. 1645, Aug. 1996.
  • X. Y. Hu, E. Eleftheriou and D. M. Arnold, “Regular and irregular progressive edge-growth tanner graphs,” IEEE Trans. Inform. Theory, Vol. 51, no. 1, pp. 386–398, Jan. 2005.
  • J. Thorpe“Low-dencity parity-check (LDPC) codes constructed from protographs,” IPN Progress Report, Aug. 2003. pp. 42–154.
  • Marc P. C. Fossorier, “Quasi-cyclic low-density parity-check codes from circulant permutation matrices,” IEEE Trans. Inform. Theory, Vol. 50, no. 8, pp. 1788–1793, 2004.
  • H. Song, J. Liu and B. V. K. V. Kumar, “Large girth cycle codes for partial response channels,” IEEE Trans. Magn., Vol. 40, pp. 3084–3086, 2004.
  • S. Kim, J-S. No, H. Chung and D-J. Shin, “Quasi-cyclic low-density parity-check codes with girth larger than 12,” IEEE Trans. Inform. Theory, Vol. 53, pp. 2885–2891, Aug 2007.
  • M. Gholami, M. Samadieh and Gh. Raeisi, “Column-weight three QC LDPC codes with girth 20,” IEEE Commun. Lett., Vol. 17, pp. 1439–1442, July 2013.
  • M. Karimi and A. H. Banihashemi, “On the girth of quasi-cyclic protograph LDPC codes,” IEEE Trans. Inform. Theory, Vol. 59, pp. 4542–4552, July 2013.
  • S. Sonavane, D. P. Rathod, S. Sukhdeve and A. Patil, “Construction of irregular LDPC code using ACE algorithim,” Int. J. Adv. Res. Computer Sci. Softw. Eng., Vol. 3, no. 3, pp. 650-–653, March 2013.
  • M. Gholami and M. Alinia, “High-performance binary and non-binary low-density parity-check codes based on affine permutation matrice,” IET Commun., Vol. 9, no. 17, pp. 2114–2123, Nov. 2015.
  • M. Gholami and M. Alinia, “Explicit APM-LDPC codes with girths 6, 8, and 10,” IEEE Signal Process. Lett., Vol. 24, no. 6, pp. 741–745, 2017.
  • M. Esmaeili, M. Najafian and A. T. Gulliver, “Structured quasi-cyclic low-density parity-check codes based on cyclotomic cosets,” IET Commun., Vol. 9, no. 4, pp. 541–547, Jan 2015.
  • M. Gholami and A. Nassaj, “Row and column extensions of 4-cycle free LDPC codes,” IEEE Commun. Lett., Vol. 20, no. 1, pp. 25–28, 2016.
  • Z. Gholami and M. Gholami, “Anti quasi-cyclic LDPC codes,” IEEE Commun. Lett., Vol. 22, no. 6, pp. 1116–1119, Jun. 2018.
  • Radford M. Neal, “Software for Low Density Parity Check (LDPC) codes,” copyright © 1995–2012. Available: http://www.cs.utoronto.ca/∼radford/ldpc.software.html

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.