Results 81 to 90 of about 21,530 (259)

Assessing and countering reaction attacks against post-quantum public-key cryptosystems based on QC-LDPC codes

, 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, A May, DJ Bernstein, E Berlekamp, E Eaton, E Prange, J Stern, K Kobara, M Baldi, M Baldi, M Baldi, MK Shooshtari, Q Guo, RG Gallager, T Fabšič   +14 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, Hyunwoo Cho, Hong‐Yeop Song, Min Kyu Song   +3 more
wiley   +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, Han Hai, Hui-Ming Wang, Moon Ho Lee   +3 more
doaj   +1 more source

Relation Between GCD Constraint and Full-Length Row-Multiplier QC-LDPC Codes With Girth Eight

IEEE Communications Letters, 2021
The greatest-common-divisor (GCD) method is a general framework employing a set of simple inequalities (called GCD constraint) to guarantee girth eight for a class of $(J,L)$ quasi-cyclic (QC) low-density parity-check (LDPC) codes.
Guohua Zhang, Yulin Hu, Yi Fang, Defeng Ren   +3 more
semanticscholar   +1 more source

Energy‐Efficiency Maximization in Backscatter Communication‐Based Non‐Orthogonal Multiple Access System: Dinkelbach and Successive Convex Approximation Approaches

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, Tianqi Wang, Kaidi Wang, Zhiguo Ding, Hasan Mir   +4 more
wiley   +1 more source

Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution

IEEE Access
This 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, Jingping Che, Huaan Li, Zhen Luo, Bo Zhang, Hui Liu   +5 more
doaj   +1 more source

Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance

, 2017
Parameters of LDPC codes, such as minimum distance, stopping distance, stopping redundancy, girth of the Tanner graph, and their influence on the frame error rate performance of the BP, ML and near-ML decoding over a BEC and an AWGN channel are studied ...
A Orlitsky, AS Asratian, C Di, CE Shannon, ER Berlekamp, G Poltyrev, H Pishro-Nik, H Pishro-Nik, I Sason, IE Bocharova, J Feldman, J Zumbrägel, M Baldi, M Jianjun, M Schwartz, N Varnica, RG Gallager, S Litsyn, T Hehn, T Richardson   +19 more
core   +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, Xiao‐Dong Zhang, Huaan Li, Hai Zhu, Bo Zhang, Hui Liu   +5 more
wiley   +1 more source

Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes with Large Girth

, 2018
We propose a low-complexity method to find quasi-cyclic low-density parity-check block codes with girth 10 or 12 and shorter length than those designed through classical approaches.
Baldi, Marco, Battaglioni, Massimo, Chiaraluce, Franco, Tadayon, Mohammad H., Tasdighi, Alireza   +4 more
core   +1 more source