Abstract:
LDPC codes are a hot topic in information coding theory right now. For ordinary to lengthy code lengths, Low-Density Parity-Check (LDPC) codes are among the most powerful channel codes. They were invented by Gallager in 1962, but they had to be re-invented by Mackay and Neal in 1997 before their powers were discovered: The channel capacity can be achieved with irregular LDPC coding. LDPC codes, unlike many other types of codes, already have very fast (probabilistic) encoding and decoding methods. The question is how to construct the codes so that these algorithms can recover the original codeword even in the presence of a lot of noise. The design problem can now be solved using new analytic and combinatorial tools. As a result, LDPC codes are not only appealing from a theoretical standpoint, but also ideal for practical applications. This study will provide a brief introduction of the origins of LDPC codes, their coding and decoding procedures, and the methodologies used to analyse and create them.
