Results 161 to 170 of about 69,988 (217)

QC-LDPC Code-Based Cryptography [PDF]

, 2014
This book describes the fundamentals of cryptographic primitives based on quasi-cyclic low-density parity-check (QC-LDPC) codes, with a special focus on the use of these codes in public-key cryptosystems derived from the McEliece and Niederreiter schemes.
Baldi, Marco
openaire   +2 more sources

Quasi-cyclic generalized ldpc codes with low error floors [PDF]

IEEE Transactions on Communications, 2008
In this paper, a novel methodology for designing structured generalized LDPC (G-LDPC) codes is presented. The proposed design results in quasi-cyclic G-LDPC codes for which efficient encoding is feasible through shift-register-based circuits.
Gianluigi Liva, W E Ryan, Marco Chiani   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

High-Throughput QC-LDPC Decoders

IEEE Transactions on Broadcasting, 2009
High-throughput design approaches for quasi-cyclic (QC) low-density parity-check (LDPC) decoders are presented in this paper. Three novel schemes for the horizontal process in min-sum algorithm and its revisions are derived to reduce design and implementation complexity.
Nan Jiang, Kewu Peng, Jian Song 0004, Chang-Yong Pan, Zhixing Yang   +4 more
openaire   +1 more source

Shortening for irregular QC-LDPC codes

IEEE Communications Letters, 2009
Shortening is a technique to obtain codes of shorter length and lower rate from a given LDPC code by putting infinite reliability on some variable nodes, whose positions are assumed to be available to both encoder and decoder. In this paper, we propose a shortening algorithm suitable for irregular QC-LDPC codes. The efficiency of the proposed algorithm
Xiaojian Liu, Xiaofu Wu, Chunming Zhao 0001   +2 more
openaire   +1 more source

Analysis of balanced cycles of QC-LDPC codes

2011 Eighth International Conference on Wireless and Optical Communications Networks, 2011
In this paper, we analyze balanced cycles of quasi-cyclic low-density parity-check (QC-LDPC) codes. We show the structure of balanced cycles and their necessary and sufficient existence conditions. Furthermore, we determine the minimal matrices of balanced cycle. Meanwhile we propose the property of B-girth in its mother matrix.
Gao Xiao, Zhang Nan
openaire   +1 more source

Generalization of floor lifting for QC-LDPC codes

2017 IEEE East-West Design & Test Symposium (EWDTS), 2017
The given paper presents a method for constructing a QC-LDPC code of shorter length by length adaption from a given QC-LDPC code of maximal length. The proposed method can be considered as a generalization of floor lifting. Making some offline calculation it is possible to construct a sequence of QC-LDPC codes with different circulant sizes generated ...
Vasiliy Usatyuk, Sergey Egorov
openaire   +1 more source

Design of masking matrix for QC-LDPC codes

2013 IEEE Information Theory Workshop (ITW), 2013
The masking matrix plays an important role in constructing new classes of regular and irregular quasi-cyclic low density parity check (QC-LDPC) codes. By coupling two identical graphs in a special way, we present a new structure of the masking matrix, whose Tanner graph can be seen as a protograph.
Yang Liu, Ying Li
openaire   +1 more source

Compressing construction of QC-LDPC codes

2008 11th IEEE Singapore International Conference on Communication Systems, 2008
Two compressing construction methods of quasi-cyclic LDPC (QC-LDPC) codes are proposed, which can be called recursive-compressing and single-compressing respectively. Selecting a good QC-LDPC code as the Mother, the son codes constructed through the compressing methods are still good codes, i.e., have high girth and few short cycles, moreover, they ...
null Shuqi Sun, null Wuyang Zhou
openaire   +1 more source

Multi-Rate QC-LDPC Encoder

2009 IEEE Circuits and Systems International Conference on Testing and Diagnosis, 2009
A multi-rate memory-efficient encoder for low-density parity-check (LDPC) codes is proposed in this paper based on shift-register-adder-accumulator (SRAA). The SRAA algorithm simplifies the encoder computation module and reduces the complexity of the operation. The LDPC code generator matrix is constructed by lots of quasi-cyclic square matrices in the
Huxing Zhang, Hongyang Yu
openaire   +1 more source

An Improved McEliece Cryptosystem Based on QC-LDPC Codes

2020
In the original McEliece cryptosystem based on QC-LDPC codes, the decoding algorithm uses BF algorithm instead of BP algorithm, which reduces the time complexity but decreases the decoding performance. To solve this problem, we improve the original algorithm and use the Q-decoder which utilizes the correlation between the error pattern e and the matrix
Fan Bu, Zhiping Shi 0001, Lanjun Li, Shujun Zhang, Dandi Yang   +4 more
openaire   +1 more source