In his pioneering work on LDPC codes, Gallager dismissed codes with parity-check matrices
of weight two after proving that their minimum Hamming distances grow at most …

In this paper, a simple and effective tool for the design of low-density parity-check (LDPC)
codes for iterative correction of bursts of erasures is presented. The design method consists …

In this paper low-density parity-check (LDPC) codes are designed for burst erasure
channels. Firstly, lower bounds for the maximum length erasure burst that can always be …

This paper analyzes and explicitly constructs quasi-cyclic (QC) codes for correcting multiple
bursts via matrix transformations. Our analysis demonstrates that the multiple-burst …

This paper presents designs and constructions of two classes of binary quasi-cyclic LDPC
codes for correcting multiple random phased-bursts of erasures over the binary erasure …

It is well known that spatially coupled (SC) codes with erasure-BP decoding have powerful
error correcting capability over memoryless erasure channels. However, the decoding …

This paper proposes an enhanced forward error correction (FEC) scheme based on small
block low-density parity-check (LDPC) codes to protect real-time packetized multimedia …

A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst
erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained …

This thesis presents two enhanced FEC-based schemes to protect real-time packetized
multimedia streams in bursty channels. The objective of these novel architectures has been …

In his pioneering work on LDPC codes, Gallager dismissed codes with parity-check matrices
of weight two after proving that their minimum Hamming distances grow at most …