In this letter, we propose a layered decoding algorithm for protograph-based low-density parity-check Hadamard codes (PLDPC-HCs), which have been shown to be ultimate-Shannon-limit approaching. Compared with the standard algorithm, improves convergence rate by about two times. At bit error of 2.0×10 -...

Most work in low-density parity-check codes focuses on bit-level errors. In this paper, we introduce and analyze veri cation codes, which are simple low-density parity-check codes speci cally designed to manipulate data in packet-sized units. Veri cation codes require only linear time for both encoding and decoding and succeed with high probability under random errors. We describe how to utiliz...

In this paper we propose a new class of irregular low-density parity check (LDPC) codes with linear encoding complexity. We show that these codes offer performances compatible with irregular LDPC codes with randomly generated parity-check matrices. The non-systematic part of the paritycheck matrix has a simple triangular structure, which enables linear encoding, while the systematic part of the...

We study a modification method for constructing lowdensity parity-check (LDPC) codes for solid burst erasures. Our proposed modification method is based on a column permutation technique for a parity-check matrix of the original LDPC codes. It can change the burst erasure correction capabilities without degradation in the performance over random erasure channels. We show by simulation results t...

A statistical theory of turbo-codes, treated as a special family of convolutional codes with a low-density parity-check matrix, is developed. The basic ideas are: the representation of the transposed parity-check matrix of turbo-codes as a product of a sparse (multiple) scrambler matrix and the transposed parity-check matrix of the basic code, the introduction of a special statistical ensemble ...

We consider the use of wideband systems for the fixed pointto-point transmission of coded data with low hit-error rate requirements. A system is defined which is based (in OFDM transmission with PSK and QAM subcarrier modulation, error control coding using low-density parity-check (LDPC) codes, and channel equalization to reduce intersymbol interference from a fading channel. Tradeoffs between ...

The design of future communication systems with high throughput demands will become a critical task, especially when sophisticated channel coding schemes have to be applied. Low-Density Parity-Check(LDPC) codes are among the most powerful forward error correcting codes, since they enable to get as close as a fraction of a dB from the Shannon limit. A simplified decoding algorithms for decoding ...

•We observed that Low-Density ParityCheck (LDPC) codes based on partial geometries have superior performance to randomly constructed codes when decoded iteratively with the sum-product algorithm. •The reason for this good performance are redundant rows in the parity-check matrix. •We compared a parity-check matrix with redundant rows (Hredundant) with a matrix with full rank (Hfull) representin...

Many communication systems are poorly modelled by the standard channels assumed in the information theory literature, such as the binary symmetric channel or the additive white Gaussian noise channel. Real systems suffer from additional problems including time-varying noise, cross-talk, synchronization errors and latency constraints. In this thesis, low-density parity-check codes and codes rela...