Minimum distance bounds of irregular QC-LDPC codes and their applications

Min Ho Shin, Joon Sung Kim, Hong Yeop Song

Research output: Contribution to journalConference article

2 Citations (Scopus)

Abstract

We consider a design of quasi-cyclic LDPC codes which have irregular column weights. We derive bit-oriented bound and parity-oriented bound on the minimum distances of irregular quasi-cyclic codes using a similar technique to Tanner's simple lower bound.

Original languageEnglish
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2004 Oct 20
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: 2004 Jun 272004 Jul 2

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Minimum distance bounds of irregular QC-LDPC codes and their applications'. Together they form a unique fingerprint.

  • Cite this