A Deviation-Based Conditional Upper Bound on the Error Floor Performance for Min-Sum Decoding of Short LDPC Codes

No abstract is available for this paper.

• Publication year

  2012

• Venue

  IEEE Transactions on Communications

• Publication date

  2012-09-13

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TCOMM.2012.091012.110830
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An efficient algorithm for finding dominant trapping sets of LDPC codes

  2011influential reference
• Iterative Construction of Regular LDPC Codes from Independent Tree-Based Minimum Distance Bounds

  2011cited by this paper
• The Manifestation of Stopping Sets and Absorbing Sets as Deviations on the Computation Trees of LDPC Codes

  2010cited by this paper
• On the dynamics of the error floor behavior in regular LDPC codes

  2009influential reference
• Instanton-based techniques for analysis and reduction of error floors of LDPC codes

  2009cited by this paper
• LDPC decoding and code design on extrinsic trees

  2009cited by this paper
• Finding All Small Error-Prone Substructures in LDPC Codes

  2009cited by this paper
• Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices

  2009influential reference
• Error rate estimation of finite-length low-density parity-check codes decoded by soft-decision iterative algorithms

  2008cited by this paper
• Pseudo-codeword Landscape

  2007cited by this paper
• A General Method for Finding Low Error Rates of LDPC Codes

  2006cited by this paper
• Instanton analysis of Low-Density Parity-Check codes in the error-floor regime

  2006cited by this paper
• Reduced-complexity decoding of LDPC codes

  2005cited by this paper
• LDPC block and convolutional codes based on circulant matrices

  2004influential reference
• Selective avoidance of cycles in irregular LDPC code construction

  2004influential reference
• Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check cCodes

  2003cited by this paper
• Error Floors of LDPC Codes

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

  2002cited by this paper
• On the Effective Weights of Pseudocodewords for Codes Defined on Graphs with Cycles

  2001cited by this paper
• Signal-space characterization of iterative decoding

  2001cited by this paper
• Codes on graphs: normal realizations

  2000influential reference
• Codes and Decoding on General Graphs

  1996influential reference
• Near Shannon limit performance of low density parity check codes

  1996cited by this paper
• A recursive approach to low complexity codes

  1981cited by this paper

• Error Floor of ML-Decoded Spinal Codes in the Finite Blocklength Regime

  2025cites this paper
• Neural signal processing techniques to analyse motor functions in EEG-based brain-computer interfaces

  2018cites this paper
• Optimized Bi-Objective EEG Channel Selection and Cross-Subject Generalization With Brain–Computer Interfaces

  2016cites this paper
• Enhanced Distance Measuring Equipment Data Broadcast Design, Analysis, Implementation, and Flight-Test Validation

  2015cites this paper