Adaptive Decoding Algorithms for Low-Density Parity-Check Codes over the Binary Erasure Channel

No abstract is available for this paper.

• Publication year

  2009

• Venue

  IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

• Publication date

  2009-10-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1587/TRANSFUN.E92.A.2418
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Modern Coding Theory

  2008cited by this paper
• Results on the Improved Decoding Algorithm for Low-Density Parity-Check Codes Over the Binary Erasure Channel

  2007cited by this paper
• Transformation of a Parity-Check Matrix for a Message-Passing Algorithm over the BEC

  2006cited by this paper
• Iterative decoding of linear block codes: a parity-check orthogonalization approach

  2005cited by this paper
• A Decoding Method of Low-Density Parity-Check Codes Over the Binary Erasure Channel

  2004cited by this paper
• Efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel

  2004influential reference
• On decoding of low-density parity-check codes over the binary erasure channel

  2004cited by this paper
• Low-Density Parity-Check Codes

  2004cited by this paper
• Selective avoidance of cycles in irregular LDPC code construction

  2004influential reference
• A Code-Equivalent Transfomation Removing Cycles of Length Four in Tanner Graphs

  2004cited by this paper
• Asymptotic enumeration methods for analyzing LDPC codes

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

  2002cited by this paper
• Efficient erasure correcting codes

  2001cited by this paper

• An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates

  2010cites this paper