Generalized Belief Propagation to break trapping sets in LDPC codes [PDF]
, 2014 6 pagesInternational audienceIn this paper, we focus on the Generalized Belief Propagation (GBP) algorithm to solve trapping sets in Low-Density Parity-Check (LDPC) codes.
Declercq, David +2 more
core +3 more sources
High-Throughput Multi-Frame Decoding of QC-LDPC Codes With Modified Rejection-Based Minimum Finding
IEEE Access, 2022 The key computation in the min-sum decoding algorithm of a Low-Density Parity-Check (LDPC) is finding the first two minima and also the location of the first minimum among a set of messages passed from Variable Nodes (VNs) to Check Nodes (CNs) in a ...
Alireza Hasani +3 more
doaj +1 more source
Belief Propagation Decoding for Short-Length Codes Based on Sparse Tanner Graph
IEEE Communications LettersYifei Shen +2 more
exaly +3 more sources
Tree-structure Expectation Propagation for Decoding LDPC codes over Binary Erasure Channels [PDF]
, 2010 Expectation Propagation is a generalization to Belief Propagation (BP) in two ways. First, it can be used with any exponential family distribution over the cliques in the graph.
Fernando Pérez-cruz +2 more
core +3 more sources
QuantumQuantum information is fragile and must be protected by a quantum error-correcting code for large-scale practical applications. Recently, highly efficient quantum codes have been discovered which require a high degree of spatial connectivity. This raises
Nouédyn Baspin, Dominic Williamson
doaj +1 more source
Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound [PDF]
Quantum, 2022 Quantum error correction has recently been shown to benefit greatly from specific physical encodings of the code qubits. In particular, several researchers have considered the individual code qubits being encoded with the continuous variable ...
Nithin Raveendran +5 more
doaj +1 more source
Minimum Distance Distribution of Irregular Generalized LDPC Code Ensembles
, 2013 In this paper, the minimum distance distribution of irregular generalized LDPC (GLDPC) code ensembles is investigated. Two classes of GLDPC code ensembles are analyzed; in one case, the Tanner graph is regular from the variable node perspective, and in ...
Flanagan, Mark F. +2 more
core +1 more source
Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States
, 2008 We proposed novel schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed scheme.
Ching-Yu Huang +4 more
core +1 more source
Study of equivalent point-to-point transmission model for coded relay cooperations
Tongxin xuebao, 2012 LDPC-coded relay cooperation and its joint iterative decoding based on the bi-layer Tanner graph were investigated.The coded relay cooperation becomed an equivalent and relatively simple point-to-point transmission model by introducing the notation of ...
Qiu-xia ZHANG +3 more
doaj +2 more sources
Algebraic Optimization of Binary Spatially Coupled Measurement Matrices for Interval Passing
, 2018 We consider binary spatially coupled (SC) low density measurement matrices for low complexity reconstruction of sparse signals via the interval passing algorithm (IPA).
Habib, Salman, Kliewer, Joerg
core +1 more source