In this letter, we propose a generalization of the progressive edge-growth (PEG) algorithm
with the aim of designing LDPC code graphs with substantially improved approximated …

A novel construction for irregular low-density parity-check (LDPC) codes based on a
modification of the Progressive Edge Growth (PEG) algorithm is presented. Edge placement …

Belief propagation (BP) decoding has been recognized for its capacity-approaching
performance and high throughput when decoding long low-density parity-check (LDPC) …

In this paper, we propose a new multi-edge metric-constrained quasi-cyclic progressive
edge-growth algorithm (MM-QC-PEGA), which is suitable for constructing both single-and …

Many studies were carried out for the construction of low density parity-check (LDPC) codes.
They usually focused on introducing the construction methods for good LDPC codes instead …

In wireless sensor networks, the reliability of communication can be greatly improved by
applying low-density parity-check (LDPC) codes. Algorithms based on progressive-edge …

In this paper we consider the experimental specification for" Short Block Length LDPC codes
for TC Synchronization and Channel Coding" by the Consultative Committee for Space Data …

We propose a simple and efficient algorithm for evaluating the girth and approximate cycle
extrinsic message degree (ACE) of all short cycles through symbol nodes in short-to …

The Extrinsic Message Degree (EMD) of a cycle in the Tanner graph of a low density parity
check (LDPC) code measures the connectivity of the cycle. As it is difficult to calculate the …

This paper proposes two new cycle-optimized algorithms, called the multi-step progressive
edge-growth (PEG) algorithm and the multi-step approximate cycle extrinsic message …