Results 171 to 180 of about 21,382 (243)
Some of the next articles are maybe not open access.

On Disjoint Difference Sets and Their Associated QC-LDPC Codes with Large Girth

2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops), 2023
The disjoint difference set (DDS) has been utilized in recent years to construct quasi-cyclic (QC) low-density parity-check (LDPC) codes without small cycles.
Guohua Zhang, Mengdi Ni, Yi Fang
semanticscholar   +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   +4 more
openaire   +1 more source

A flexible decoder IC for WiMAX QC-LDPC codes

2008 IEEE Custom Integrated Circuits Conference, 2008
A programmable and power-efficient decoder IC employing the layered-decoding message-passing algorithm and the low-complexity offset-based Min-Sum check algorithm for irregular QC-LDPC codes is presented. The iterative decoder can be reconfigured to decode all the QC-LDPC codes defined in the Mobile WiMAX standard.
Tzu-Chieh Kuo, Alan N. Willson Jr.
openaire   +1 more source

Construction of QC-LDPC Codes with Girth $g$ from the Hermite Normal Form of a Matrix

International Symposium on Information Theory
The problem of determining the existence of a protograph-based QC-LDPC code with girth $g$ and shortest blocklength for a prescribed protograph has been investigated in the literature.
Anthony Gómez-Fonseca
semanticscholar   +1 more source

Protograph design for QC LDPC codes with large girth

2010 International Conference on Information and Communication Technology Convergence (ICTC), 2010
In this paper, all subgraph patterns of protographs which prevent quasi-cyclic (QC) low-density parity-check (LDPC) codes from having large girth are searched in allowance with multiple edges based on graph theoretic approach. A systematic construction of protograph with multiple edges using combinatorial design is proposed for QC LDPC codes with girth
Hosung Park   +3 more
openaire   +1 more source

Block Markov Superposition Transmission of Algebraic QC-LDPC Codes for Optical Fiber Communications

Wireless and Optical Communications Conference, 2022
In this paper, a new forward error correcting (FEC) scheme is proposed for optical fiber communication system, which takes the algebraic quasi-cyclic low-density parity-check (QC-LDPC) codes as the component codes in the block Markov superposition ...
Juewei Wang, Chao Chen, Xiao Ma
semanticscholar   +1 more source

A QC-LDPC Code Based Digital Signature Algorithm

2018 International Conference on Networking and Network Applications (NaNA), 2018
CFS digital signature algorithm, which proposed in 2001, is the most important code based digital signature algorithm and can resist the known attack of quantum algorithms. But the efficiency of CFS is very low because of the extremely low signing speed and the large public key size. In this paper, a variation of CFS algorithm is presented.
Fang Ren, Xuefei Yang, Dong Zheng 0001
openaire   +2 more sources

Sharp Error-Rate Transitions in Quantum QC-LDPC Codes Under Joint BP Decoding

International Conference on Quantum Computing and Engineering
In this study, we report that quantum quasi-cyclic low-density parity-check codes decoded via joint belief propagation exhibit steep error-rate curves, despite the presence of error floors.
Daiki Komoto, Kenta Kasai
semanticscholar   +1 more source

McEliece Cryptosystem: Reducing the Key Size with QC-LDPC codes

International Workshop on the Design of Reliable Communication Networks, 2023
Post-quantum cryptography is a growing area since Shor showed that a quantum computer with enough qubits could be used to break the most widely used public-key cryptographic protocols today, such as RSA or those based on the discrete logarithm problem ...
Paula Pérez-Pacheco, P. Caballero-Gil
semanticscholar   +1 more source

Low Complexity Decoding Algorithm of QC-LDPC Code

2010 IEEE Asia-Pacific Services Computing Conference, 2010
Through the research on the decoding algorithm of low-density parity-check (LDPC) code, a low complexity decoding algorithm suitable for quasi-cyclic LDPC (QC-LDPC) code is proposed in this paper. The algorithm adopts layered decoding (LD), and the sub-minimum is replaced by the sum of an optimal correction factor and the minimum during the process of ...
Fanglong Yi, Pengjun Wang
openaire   +1 more source

Home - About - Disclaimer - Privacy