Skip to content


  • Research Article
  • Open Access

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

EURASIP Journal on Wireless Communications and Networking20052005:692121

  • Received: 27 January 2005
  • Published:


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.


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

Authors’ Affiliations

QUALCOMM Incorporated, San Diego, CA 92121, USA
Jet Propulsion Laboratory, California Institute of Technology, NASA, CA, 91109, USA


© T. Tian and C. R. Jones 2005

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.