Results 41 to 50 of about 1,996 (184)
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
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
Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes
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
QC-LDPC Codes from Difference Matrices and Difference Covering Arrays
Abstract We give a framework for generalizing LDPC code constructions that use Transversal Designs or related structures such as mutually orthogonal Latin squares. Our construction offers a broader range of code lengths and codes rates. Similar earlier constructions rely on the existence of finite fields of order a power of a prime. In contrast
Diane M. Donovan +3 more
openaire +3 more sources
Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm
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
Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution
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 +5 more
doaj +1 more source
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 +19 more
core +1 more source
Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes with Large Girth
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 +4 more
core +1 more source
7.7Gbps encoder design for IEEE 802.11n/ac QC-LDPC codes [PDF]
This paper proposes a high throughput encoding process and encoder architecture for quasi-cyclic low-density parity-check (QC-LDPC) codes in IEEE 802.11n/ac standards. In order to achieve the high throughput with low complexity, a partially parallel processing based encoding process and encoder architecture are proposed.
Yong-Min Jung +3 more
openaire +1 more source
Improving the efficiency of the LDPC code-based McEliece cryptosystem through irregular codes
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

