Joint iterative decoding of LDPC codes for channels with memory and erasure noise

No abstract is available for this paper.

• Publication year

  2008

• Venue

  IEEE Journal on Selected Areas in Communications

• Publication date

  2008-02-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/JSAC.2008.080209
• 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
• Joint Iterative Decoding of LDPC Codes and Channels with Memory

  2007cited by this paper
• Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding

  2007cited by this paper
• Simulation-Based Computation of Information Rates for Channels With Memory

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

  2005cited by this paper
• Matched information rate codes for Partial response channels

  2005cited by this paper
• Elements of Information Theory

  2005cited by this paper
• Analysis of low-density parity-check codes for the Gilbert-Elliott channel

  2005cited by this paper
• Capacity-achieving ensembles for the binary erasure channel with bounded complexity

  2004cited by this paper
• Extrinsic information transfer functions: model and erasure channel properties

  2004cited by this paper
• On near-capacity coding systems for partial-response channels

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

  2004cited by this paper
• Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes

  2003cited by this paper
• Optimized low-density parity-check codes for partial response channels

  2003cited by this paper
• Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds

  2003influential reference
• On the capacity of finite state channels and the analysis of convolutional accumulate-m codes

  2003cited by this paper
• On the performance of high-rate TPC/SPC codes and LDPC codes over partial response channels

  2002cited by this paper
• Turbo equalization: principles and new results

  2002cited by this paper
• Asymptotic Analysis of Turbo Codes over the Binary Erasure Channel

  2002influential reference
• Joint message-passing decoding of LDPC Codes and partial-response channels

  2002cited by this paper
• The capacity of low-density parity-check codes under message-passing decoding

  2001cited by this paper
• Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels

  2001cited by this paper
• Capacity-achieving sequences for the erasure channel

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

  2001cited by this paper
• Convergence behavior of iteratively decoded parallel concatenated codes

  2001cited by this paper
• On the information rate of binary-input channels with memory

  2001cited by this paper
• Efficient erasure correcting codes

  2001cited by this paper
• Factor graphs and the sum-product algorithm

  2001cited by this paper
• On the achievable information rates of finite state ISI channels

  2001cited by this paper
• The generalized distributive law

  2000cited by this paper
• Effect of precoding on the convergence of turbo equalization for partial response channels

  2000cited by this paper
• Rate one-half code for approaching the Shannon limit by 0.1 dB

  2000cited by this paper
• Analysis of random processes via And-Or tree evaluation

  1998cited by this paper
• Codes for Digital Recorders

  1998cited by this paper
• Practical loss-resilient codes

  1997cited by this paper
• Iterative correction of intersymbol interference: Turbo-equalization

  1995cited by this paper
• Capacity, mutual information, and coding for finite-state Markov channels

  1994cited by this paper
• Singularity Analysis of Generating Functions

  1990cited by this paper
• Capacity and coding for the Gilbert-Elliot channels

  1989cited by this paper
• Capacity and information rates of discrete-time channels with memory

  1988cited by this paper
• Error bounds for asymptotic expansions of the ratio of two gamma functions

  1987cited by this paper
• Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

  1974cited by this paper
• Ordinary differential equations : an elementary textbook for students of mathematics, engineering, and the sciences

  1963cited by this paper
• Capacity of a burst-noise channel

  1960cited by this paper

• The Art of Noise Modeling and Mitigation on Power Line Communication in Distributed Energy System

  2025cites this paper
• Capacity of Finite-State Channels With Delayed Feedback

  2023cites this paper
• Computable Upper Bounds on the Capacity of Finite-State Channels

  2019cites this paper
• Design Guidelines of Low-Density Parity-Check Codes for Magnetic Recording Systems

  2018cites this paper
• Monitoring Bats in the Wild: On Using Erasure Codes for Energy-Efficient Wireless Sensor Networks

  2016cites this paper
• A Single-Letter Upper Bound on the Feedback Capacity of Unifilar Finite-State Channels

  2016influential citation
• Spatially-coupled codes approach symmetric information rate of finite-state Markov fading channels

  2016cites this paper
• Single-letter bounds on the feedback capacity of unifilar finite-state channels

  2016cites this paper
• A single-letter upper bound on the feedback capacity of unifilar finite-state channels

  2016cites this paper
• Spatially-coupled MacKay-Neal codes universally achieve the symmetric information rate of arbitrary generalized erasure channels with memory

  2015cites this paper
• A Simple Proof of Maxwell Saturation for Coupled Scalar Recursions

  2013influential citation
• Threshold saturation of spatially-coupled codes on intersymbol-interference channels

  2012cites this paper
• A simple proof of threshold saturation for coupled scalar recursions

  2012cites this paper
• Capacity-Achieving Schemes for Finite-State Channels.

  2011cites this paper
• Spatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels

  2011cites this paper
• Threshold saturation on channels with memory via spatial coupling

  2011influential citation
• Statistical Mechanical Analysis of Low-Density Parity-Check Codes on General Markov Channel

  2011cites this paper
• Capacity-achieving codes for channels with memory with maximum-likelihood decoding

  2009cites this paper
• Capacity-achieving codes for finite-state channels with maximum-likelihood decoding

  2009cites this paper
• Upper bounds on the MAP threshold of iterative decoding systems with erasure noise

  2008cites this paper