On systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Allerton Conference on Communication, Control, and Computing

• Publication date

  2009-09-30

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ALLERTON.2009.5394793
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Raptor codes

  2011cited by this paper
• New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel

  2010influential reference
• Finite-length rate-compatible LDPC codes: a novel puncturing scheme - [transactions letters]

  2009cited by this paper
• Modern Coding Theory

  2008influential reference
• Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques

  2007influential reference
• On Universal Properties of Capacity-Approaching LDPC Code Ensembles

  2007cited by this paper
• On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications

  2007cited by this paper
• Design of Rate-Compatible Irregular Repeat Accumulate Codes

  2007cited by this paper
• Rate-compatible punctured low-density parity-check codes with short block lengths

  2006cited by this paper
• Why We Can Not Surpass Capacity: The Matching Condition

  2005cited by this paper
• Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity

  2005cited by this paper
• Capacity achieving LDPC codes through puncturing

  2005cited by this paper
• Nonuniform error correction using low-density parity-check codes

  2005influential reference
• Capacity-achieving ensembles for the binary erasure channel with bounded complexity

  2004cited by this paper
• On construction of rate-compatible low-density parity-check codes

  2004cited by this paper
• Rate-compatible puncturing of low-density parity-check codes

  2004influential reference
• Parity-check density versus performance of binary linear block codes over memoryless symmetric channels

  2003cited by this paper
• Finite-length analysis of low-density parity-check codes on the binary erasure channel

  2002cited by this paper
• Design of capacity-approaching irregular low-density parity-check codes

  2001influential reference
• Capacity-achieving sequences for the erasure channel

  2001cited by this paper
• Capacity-achieving sequences

  2001influential reference
• New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity

  1999cited by this paper
• Practical loss-resilient codes

  1997cited by this paper

• On Generalized EXIT charts of LDPC code ensembles over binary-input output-symmetric memoryless channels

  2012cites this paper
• Degree Distribution Design for LDPC Codes: A Derivative Matching Approach

  2011cites this paper