Results 71 to 80 of about 1,996 (184)

On a class of column‐weight 3 decomposable LDPC codes with the analysis of elementary trapping sets

open access: yesIET Communications
A column‐weight k LDPC code with the parity‐check matrix H is called decomposable if there exists a permutation π on the rows of H, such that π(H) can be decomposed into k column‐weight one matrix.
G. Raeisi, M. Gholami
doaj   +1 more source

Explicit construction of girth-eight QC-LDPC codes and its application in CRT method

open access: yesTongxin xuebao, 2012
For arbitrary code lengths of the form PL(P≥3L<sup>2</sup>/4+L-1),a new family of (4,L)-regular quasi-cyclic (QC) low-density parity-check (LDPC) codes was proposed explicitly with girth ight.Employing the new code as a component code in the ...
Guo-hua ZHANG, Rong SUN, Xin-mei WANG
doaj   +2 more sources

Short Blocklength Nonbinary Raptor-Like LDPC Coding Systems Design and Simulation

open access: yesIEEE Access
This paper explores an efficient rate-adaptive error correction coding scheme with a nonbinary (NB) $\mathrm {GF}(2^{q})$ extension of Raptor-like (RL) quasi-cyclic (QC) subclass of Low-Density Parity-Check (LDPC) codes.
Jakub Hyla, Wojciech Sulek
doaj   +1 more source

Reduced-Complexity Belief Propagation Decoding for LDPC Codes

open access: yesIEEE Access
Two methods are proposed to reduce the complexity of the belief propagation (BP) decoding for low-density parity-check (LDPC) codes, with the focus on the layered decoding for quasi-cyclic LDPC (QC-LDPC) codes.
Heping Wan   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy