Results 81 to 90 of about 45,321 (190)

QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns

open access: yesInternational Journal of Information and Communication Technology Research, 2016
In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the ...
Mohammad Hesam Tadayon   +1 more
doaj  

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

Tanner Graph Based Low Complexity Cycle Search Algorithm for Design of Block LDPC Codes [PDF]

open access: bronze, 2014
Se Chang Myung   +4 more
openalex   +1 more source

Iterative decoding on multiple tanner graphs using random edge local complementation [PDF]

open access: green, 2009
Joakim Grahl Knudsen   +4 more
openalex   +1 more source

Home - About - Disclaimer - Privacy