This paper extends the class of low-density paritycheck (LDPC) codes that can be algebraically constructed. We present regular LDPC codes based on resolvable Steiner 2-designs which have Tanner graphs free of four-cycles. The resulting codes are -regular or -regular for any value of and for a flexible choice of code lengths.

We define a family of high-rate binary LDPC codes for ADSL. We present simulation results that show the performance that can be achieved by these codes on a binary additive white Gaussian noise (AWGN) channel. LDPC codes exhibit performance very close to the capacity limit with moderate decoding complexity and are thus well suited for channel coding applications in ADSL systems.

In this paper we describe how to use special induced subgraphs of generalized m-gons to obtain the LDPC error correcting codes. We compare the properties of codes related to the affine parts of q-regular generalised 6-gons with the properties of known LDPC codes corresponding to the graphs D(5, q).

In this paper, we discuss the performance of a progressive quality image transmission scheme using Unequal Error Protection (UEP) optimized LDPC codes. We show that the irregularity of LDPC codes can be optimized to provide more protection to the most sensitive bits within a codeword. Applying this in a quality progressive image transmission context, the designed code improves performance compa...

BURST CORRECTION CODING FROM LOW-DENSITY PARITY-CHECK CODES Wai Han Fong, PhD George Mason University, 2015 Dissertation Director: Dr. Shih-Chun Chang Dissertation Co-Director: Dr. Shu Lin This thesis explores techniques and theoretical bounds on efficiently encodable low-density parity-check (LDPC) codes for correcting single and multiple bursts of erasures and/or errors. The approach is to co...

Low Density Parity Check (LDPC) codes have been the center of numerous researches in the last ten years. The reason for this interest is due to the performance (Error ratio over SNR) that these codes can achieve keeping the complexity of the pair coding/decoding to a level lower than other codes such as Turbo codes. This project aims to continue and intensify performance simulations on LDPC cod...

Due to their Shannon-limit-approaching performance and low-complexity decoding, low-density parity-check (LDPC) codes have been used for forward error correction in a broad-range of communication and storage systems. In addition to its low-complexity, the iterative decoding algorithm used for decoding LDPC codes is inherently parallel. To exploit the parallelism at a larger extent, a significan...

In the practical continuous-variable quantum key distribution (CV-QKD) system, postprocessing process, particularly error correction part, significantly impacts system performance. Multi-edge type low-density parity-check (MET-LDPC) codes are suitable for CV-QKD systems because of their Shannon-limit-approaching performance at a low signal-to-noise ratio (SNR). However, process designing low-ra...

The combination of powerful error correcting codes such as (LDPC) codes and Quadrature Amplitude Modulation (QAM) has been widely deployed in wireless communication standards such as the IEEE 802.11n and DVB-T2. Recently, several Unequal Error Protection schemes which exploit non-uniform degree distribution of bit nodes in irregular LDPC codes have been proposed. In parallel, schemes that explo...

In this paper, LDPC Codes based on defected fullerene graphs have been generated. And it is found that the codes generated are fast in encoding and better in terms of error performance on AWGN Channel. Keywords—LDPC Codes, Fullerene Graphs, Defected Fullerene Graphs.