Lecture 9: LDPC codes from bipartite expander graphs

Written on 16.06.2021 11:31 by Anand Narayanan

Hi all,

On today's lecture we will study Low Density Parity Check (LDPC) codes, among the simplest and most widely used codes in practice.

We will construct good LDPC codes from explicit bipartite expander graphs and devise a simple fast decoding algorithm.


Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators.