Results 121 to 130 of about 253 (177)
Some of the next articles are maybe not open access.
An Improved McEliece Cryptosystem Based on QC-LDPC Codes
2020In 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
Row Division Method to Generate QC-LDPC Codes
2009 Fifth Advanced International Conference on Telecommunications, 2009To cut down the hardware implementation cost this paper presents an efficient method to construct large girth Quasi-Cyclic low density parity check (QC-LDPC) codes. The row groups are paired two times the row weight, which has the complexity as compared to the connection of individual columns and rows.
Abid Yahya +3 more
openaire +1 more source
A flexible decoder IC for WiMAX QC-LDPC codes
2008 IEEE Custom Integrated Circuits Conference, 2008A 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
Protograph design for QC LDPC codes with large girth
2010 International Conference on Information and Communication Technology Convergence (ICTC), 2010In 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
Constructions of QC LDPC codes based on integer sequences
Science China Information Sciences, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lijun Zhang, Bing Li, Lee Lung Cheng
openaire +1 more source
A QC-LDPC Code Based Digital Signature Algorithm
2018 International Conference on Networking and Network Applications (NaNA), 2018CFS 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 0004 +2 more
openaire +2 more sources
Low Complexity Decoding Algorithm of QC-LDPC Code
2010 IEEE Asia-Pacific Services Computing Conference, 2010Through 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
Combinatorial optimization for improving QC LDPC codes performance
2013 IEEE International Symposium on Information Theory, 2013Techniques for searching for good quasi-cyclic (QC) LDPC block codes of short and moderate lengths which are suitable for practical purposes are studied. To facilitate implementations only codes whose parity-check matrices having bidiagonal structure of their submatrices and consequently having low encoding complexity are considered.
Irina E. Bocharova +2 more
openaire +1 more source
Low power decoder design for QC-LDPC codes
Proceedings of 2010 IEEE International Symposium on Circuits and Systems, 2010This paper presents a low-power decoder design approach for generic quasi-cyclic low-density parity-check (QC-LDPC) codes based on the layered min-sum decoding algorithm. To reduce the energy consumption, a novel message length-shortening scheme is explored.
Kai He +3 more
openaire +1 more source
Efficient Search of Girth-Optimal QC-LDPC Codes
IEEE Transactions on Information Theory, 2016In this paper, we study the cycle structure of quasi-cyclic (QC) low-density parity-check (LDPC) codes with the goal of obtaining the shortest code with a given degree distribution and girth. We focus on QC-LDPC codes, whose Tanner graphs are cyclic liftings of fully connected base graphs of size $3 \times n, n \geq 4$ , and obtain minimal lifting
Alireza Tasdighi +2 more
openaire +1 more source