New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel

No abstract is available for this paper.

• Publication year

  2010

• Venue

  IEEE Transactions on Information Theory

• Publication date

  2010-12-01

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  DOI 10.1109/TIT.2010.2053874
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Systematic design of low-density parity-check code ensembles for binary erasure channels

  2010cited by this paper
• Pseudo-binomial degree distributions from derivative matching

  2008cited by this paper
• Modern Coding Theory

  2008cited by this paper
• On Convergence Speed of Capacity-Achieving Sequences for Erasure Channel

  2008cited by this paper
• Bounds on the Number of Iterations for Turbo-Like Ensembles Over the Binary Erasure Channel

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

  2005cited by this paper
• Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel

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

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

  2004cited by this paper
• 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

  2001cited by this paper
• Capacity-achieving sequences

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

  2001influential reference
• Efficient erasure correcting codes

  2001cited by this paper
• New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity

  1999cited by this paper
• IEEE Transactions on Information Theory

  1998cited by this paper
• Practical loss-resilient codes

  1997cited by this paper
• A and V

  1962influential reference
• and as an in

  year unknowninfluential reference

• The Stability of Low-Density Parity-Check Codes and Some of its Consequences

  2020cites this paper
• Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles

  2019cites this paper
• Multiedge-type low-density parity-check codes for continuous-variable quantum key distribution

  2018cites this paper
• Reconciliation of Weakly Correlated Information Sources Utilizing Generalized EXIT Chart

  2018cites this paper
• LDPC code design for correlated sources using EXIT charts

  2017cites this paper
• Design of Capacity Approaching Ensembles of LDPC Codes for Correlated Sources using EXIT Charts

  2017cites this paper
• Design of LDPC Codes Degree Sequences on Random Particle Swarm Optimization over Mixed Channel

  2016cites this paper
• An efficient complexity-optimizing LDPC code design for the binary erasure channel

  2014cites this paper
• Construction of quasi‐cyclic low‐density parity‐check codes with low encoding complexity

  2014cites this paper
• On the Design of Fast Convergent LDPC Codes for the BEC: An Optimization Approach

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

  2012cites this paper
• Customized Raptor Code Designs for Finite Lengths and Practical Settings

  2012cites this paper
• Annotated raptor codes

  2011cites this paper
• Optimal rate for irregular LDPC codes in binary erasure channel

  2011cites this paper
• Optimal rate and maximum erasure probability LDPC codes in binary erasure channel

  2011cites this paper
• Network Codes with Overlapping Chunks over Line Networks: A Case for Linear-Time Codes

  2011cites this paper
• Successive Maximization for Systematic Design of Universally Capacity Approaching Rate-Compatible Sequences of LDPC Code Ensembles over Binary-Input Output-Symmetric Memoryless Channels

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

  2011cites this paper
• Generalized EXIT chars for irregular LDPC codes

  2011cites this paper
• Systematic design of low-density parity-check code ensembles for binary erasure channels

  2010cites this paper
• Construction of Burst-Erasure Efficient LDPC Codes for Use with Belief Propagation Decoding

  2010cites this paper
• On LDPC codes over symmetric channels

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

  2009influential citation
• New sequences of capacity achieving LDPC code ensembles over the binary erasure channel

  2008influential citation