Abstract
Low-Density Parity Check (LDPC) codes were discovered by Robert Gallager in 1963, but were abandoned due to their computational cost, which was considered too high at the time. During the 1980s, they were revived, thanks in part to the theory of expander graphs, which allowed the construction of LDPC codes that can be encoded and decoded in linear time. Today, LDPC codes are found in most digital communication systems we use daily (WiFi, 5G, digital satellite television, etc.). This talk will discuss the journey of LDPC codes from their origins, through expander graph theory, to today's practical applications.