LDPC and turbo codes
Kluwer Academic Publishers eBooks · 2006
Classes of codes defined on graphs exist that can approach Shannon’s capacity bound quite closely, and with a reasonable decoding complexity. All these codes are obtained by connecting simple component codes through an interleaver. Decoding consists of iterative decodings of these simple codes. In this chapter we describe in some detail turbo aides and low-density parity-check codes, with special attention to their performance and their decoding algorithms. Their distance properties are also given some attention.