Results 51 to 60 of about 1,775 (200)
Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm
IEEE Access, 2017 For a given base graph, the lifted graph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the lifted graph corresponds to a quasi-cyclic (QC) protograph low-density parity-check (LDPC) code.
Xue-Qin Jiang +3 more
doaj +1 more source
On the Girth of (3,L) Quasi-Cyclic LDPC Codes based on Complete Protographs
, 2015 We consider the problem of constructing $(3,L)$ quasi-cyclic low-density parity-check (LDPC) codes from complete protographs. A complete protograph is a small bipartite graph with two disjoint vertex sets such that every vertex in the variable-node set ...
Divsalar, Dariush +2 more
core +1 more source
Reordered static layered schedule for 5G low‐density parity‐check codes
Electronics Letters, Volume 60, Issue 7, April 2024.A static layered schedule for the 5G low‐density parity‐check codes is proposed here. The proposed static layered schedule provides better error performance and faster convergence speed than state‐of‐the‐art. Abstract The error performance of the 5G low‐density parity‐check codes is significantly impacted by the update order of layers.
Yangcan Zhou, Zhongfeng Wang
wiley +1 more source
Time-Invariant Spatially Coupled Low-Density Parity-Check Codes with Small Constraint Length
, 2016 We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping procedures ...
Baldi, Marco +3 more
core +1 more source
Some variations of Tanner's construction for short length QC‐LDPC codes
Electronics Letters, Volume 60, Issue 3, February 2024.We propose a variation of Tanner's construction for quasi‐cyclic low‐density parity‐check codes in a way that allows us to use NON‐prime lifting sizes by using some arithmetic sequences instead of geometric sequences. We prove two theorems on the values of this lifting sizes so that the resulting code has girth at least 8.
Wonjun Kim +3 more
wiley +1 more source
Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution
IEEE AccessThis paper studies a class of quasi-cyclic LDPC (QC-LDPC) codes, i.e., Tanner (3, 23)-regular QC-LDPC codes of code length $23p$ with $p$ being a prime and $p \equiv 1 (\mathrm {mod} 69)$ .
Qi Wang +5 more
doaj +1 more source
IEEE Access, 2019 Recently, rate-compatible raptor-like quasi-cyclic low-density parity-check (RL-QC-LDPC) codes, which are a typical class of multi-edge type LDPC codes with excellent performance and high flexibility, have been adopted in the technical specification of ...
Yushu Zhang +3 more
doaj +1 more source
IEEE Access, 2020 Considering code-based cryptography, quasi-cyclic low-density parity-check (QC-LDPC) codes are foreseen as one of the few solutions to design post-quantum cryptosystems.
Davide Zoni +2 more
doaj +1 more source
Improving the efficiency of the LDPC code-based McEliece cryptosystem through irregular codes
, 2013 We consider the framework of the McEliece cryptosystem based on LDPC codes, which is a promising post-quantum alternative to classical public key cryptosystems.
Baldi, Marco +3 more
core +1 more source
Derived dynamic scheduling for belief propagation decoding of LDPC codes
Electronics Letters, Volume 60, Issue 4, February 2024.Our article introduces two innovative dynamic scheduling strategies, derived informed variable‐to‐check residual belief propagation and derived variable‐node and variable‐to‐check‐edge residual belief propagation, for low‐density parity‐check (LDPC) codes.
Xiaotian Xu, Hua Zhou, Jiayi Zhao
wiley +1 more source