RAMANUJAN GRAPHS IN THE CONSTRUCTION OF LDPC CODES
Walter H. Chen · 2004
Abstract. Low-density parity-check (LDPC) codes have recently become a popular interdisciplinary area of research. Widely unknown after their invention by Gallager in 1965, the existence of efficient encoding and decoding algorithms coupled with performance that operates near theoretical limits has led to the rediscovery of LDPC codes. This paper will address the reasoning and construction of LDPC codes with Ramanujan graphs. Most of the material here can be found in [1] and [5]. 1.