OF THE THESIS Properties of LDGM-LDPC codes With Applications to Secrecy Coding by Manik Raina Thesis Directors: Professor Predrag Spasojević The ensemble of low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes has been proposed in literature. In this thesis, an irregular LDGM-LDPC code is studied as a sub-code of an LDPC code with some randomly punctured outputbits. It is sh...

In this paper, we propose a novel method for constructing quasi-cyclic low-density parity check (QC-LDPC) codes based row division method which can guarantee a concentrated node degree distribution with large girth. The main advantage is that large girth QC-LDPC codes can be easily constructed with a variety of block lengths and rates. Simulation results show that the proposed codes perform sig...

We suggest a new protocol for the information reconciliation stage of quantum key distribution based on polar codes. The suggested approach is blind technique, which proved to be useful low-density parity-check (LDPC) show that outperforms with LDPC codes, especially when there are high fluctuations in bit error rate (QBER).

This paper considers the optimization of multi-edge type low-density parity-check (METLDPC) codes to maximize the decoding threshold. We propose an algorithm to jointly optimize the node degree distribution and the multi-edge structure of MET-LDPC codes for given values of the maximum number of edge-types and maximum node degrees. This joint optimization is particularly important for MET-LDPC c...

Low Density Parity Check (LDPC) codes are one of the best error correcting codes that enable the future generations of wireless devices to achieve higher data rates with excellent quality of service. This paper presents two novel flexible decoder architectures. The first one supports (3, 6) regular codes of rate 1/2 that can be used for different block lengths. The second decoder is more genera...

‎s‎. ‎kim et al‎. ‎have been analyzed the girth of some algebraically‎ ‎structured quasi-cyclic (qc) low-density parity-check (ldpc)‎ ‎codes‎, ‎i.e‎. ‎tanner $(3,5)$ of length $5p$‎, ‎where $p$ is a prime of‎ ‎the form $15m+1$‎. ‎in this paper‎, ‎by extension this method to‎ ‎tanner $(3,7)$ codes of length $7p$‎, ‎where $p$ is a prime of the‎ ‎form $21m‎+ ‎1$‎, ‎the girth values of tanner $(3,7...

This paper presents high-performance encoder and decoder architectures for a class of Low Density Parity Check (LDPC) codes. The codes considered here are based on the Parallelly Concatenated Parity Check encoder structure. A major advantage of these codes is that the generator matrix and the parity check matrix are both sparse, which leads to efficient VLSI implementations for the encoder and ...

The main goal of coding theory is to devise efficient systems to exploit the full capacity of a communication channel, thus achieving an arbitrarily small error probability. Low Density Parity Check (LDPC) codes are a family of block codes—characterised by admitting a sparse parity check matrix—with good correction capabilities. In the present paper the orbits of subspaces of a finite projectiv...

In this paper, we propose a new approach to construct a class of check-hybrid generalized low-density parity-check (CHGLDPC) codes which are free of small trapping sets. The approach is based on converting some selected check nodes involving a trapping set into super checks corresponding to a 2-error correcting component code. Specifically, we follow two main purposes to construct the check-hyb...

Low-Density Parity-Check (LDPC) codes are increasingly being considered as good candidates for the nextgeneration FEC codes in high throughput wireless and recording applications. Trapping sets (TSs) are known to cause error floors in regular and irregular low-density parity-check (LDPC) codes. In existing algorithm, namely the Progressive-Edge-Growth Approximate-minimum-Cycle-Set-Extrinsic-mes...