The Manifestation of Stopping Sets and Absorbing Sets as Deviations on the Computation Trees of LDPC Codes
The error mechanisms of iterative message-passing decoders for low-density parity-check codes are studied. A tutorial review is given of the various graphical structures, including trapping sets, stopping sets, and absorbing sets that are frequently used to characterize the errors observed in simula...
Saved in:
Main Authors: | Eric Psota, Lance C. Pérez |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2010-01-01
|
Series: | Journal of Electrical and Computer Engineering |
Online Access: | http://dx.doi.org/10.1155/2010/432495 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
LDPC-cat codes for low-overhead quantum computing in 2D
by: Diego Ruiz, et al.
Published: (2025-01-01) -
On the Performance of Rate-Compatible LDPC Codes under All-Integer Quantization Decoding
by: Patinya Muangkammuen, et al.
Published: (2022-01-01) -
Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes With Overcomplete Check Matrices
by: Sisi Miao, et al.
Published: (2025-01-01) -
Performance Analysis for Cooperative Communication System with QC-LDPC Codes Constructed with Integer Sequences
by: Yan Zhang, et al.
Published: (2015-01-01) -
High-rate quantum LDPC codes for long-range-connected neutral atom registers
by: Laura Pecorari, et al.
Published: (2025-01-01)