Skip to main content


Construction of Rate-Compatible LDPC Codes Utilizing Information Shortening and Parity Puncturing

Article metrics


This paper proposes a method for constructing rate-compatible low-density parity-check (LDPC) codes. The construction considers the problem of optimizing a family of rate-compatible degree distributions as well as the placement of bipartite graph edges. A hybrid approach that combines information shortening and parity puncturing is proposed. Local graph conditioning techniques for the suppression of error floors are also included in the construction methodology.

Author information

Correspondence to Tao Tian.

Rights and permissions

Reprints and Permissions

About this article


  • rate compatibility
  • shortened codes
  • punctured codes
  • irregular low-density parity-check codes
  • density evolution
  • extrinsic message degree