Results 71 to 80 of about 21,382 (243)
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
Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes
, 2019 In this paper we study reaction and timing attacks against cryptosystems based on sparse parity-check codes, which encompass low-density parity-check (LDPC) codes and moderate-density parity-check (MDPC) codes.
A Becker +16 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
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
, 2018 Code-based public-key cryptosystems based on QC-LDPC and QC-MDPC codes are promising post-quantum candidates to replace quantum vulnerable classical alternatives.
A Becker +14 more
core +1 more source
IET Signal Processing, Volume 2024, Issue 1, 2024.This paper investigates a backscatter communication (BackCom) based non‐orthogonal multiple access (NOMA) system in a multiple‐input and single‐output (MISO) scenario, where two decoding methods are deployed, including the sum‐capacity approach and QR decomposition.
Dingjia Lin +4 more
wiley +1 more source
A cyclic‐shift based method for counting cycles of quasi‐cyclic LDPC codes
Electronics Letters, Volume 60, Issue 2, January 2024.This paper presents some new necessary and sufficient conditions for the existence of cycles with arbitrary lengths and proposes a simple and novel method for counting cycles of QC‐LDPC codes based on the improved condition. Compared with the existing methods, the presented method is effective and feasible and can enumerate cycles of QC‐LDPC codes in a
Hengzhou Xu +5 more
wiley +1 more source
Counting short cycles of QC‐LDPC codes in base graph
Electronics Letters, Volume 60, Issue 2, January 2024.Here, a method for using the base matrix to count the number of short cycles of quasi‐cyclic low‐density parity‐check codes is proposed. The time complexity of the proposed algorithm is not directly related to the length of the codes, but only to the number of edges in the base graph. Moreover, as the lifting degree of the codes increases, the proposed
Liqian Wang +3 more
wiley +1 more source
Tight bounds for LDPC and LDGM codes under MAP decoding
, 2005 A new method for analyzing low density parity check (LDPC) codes and low density generator matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is introduced.
Montanari, Andrea
core +2 more sources
Construction and Encoding of QC-LDPC Codes Using Group Rings [PDF]
IEEE Transactions on Information Theory, 2017 Quasi-cyclic (QC) low-density parity-check (LDPC) codes which are known as QC-LDPC codes, have many applications due to their simple encoding implementation by means of cyclic shift registers. In this paper, we construct QC-LDPC codes from group rings.
Hassan Khodaiemehr, Dariush Kiani
openaire +2 more sources