Results 121 to 130 of about 250 (178)
Some of the next articles are maybe not open access.
A new construction of UEP QC-LDPC codes
2010 IEEE International Symposium on Information Theory, 2010In this paper, a new construction of quasi-cyclic low-density parity-check (QC-LDPC) codes for unequal error protection (UEP) is proposed. We first give a new class of UEP block codes. QC-LDPC codes with binomial-term parity-check matrices which can avoid girths less than 8 and achieve an enlarged upper bound on the minimum distance are also introduced.
Chi-Jen Wu +2 more
openaire +1 more source
Analysis of balanced cycles of QC-LDPC codes
2011 Eighth International Conference on Wireless and Optical Communications Networks, 2011In 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), 2017The 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), 2013The 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, 2008Two 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
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
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
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
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