Document Type
Article
Publication Date
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.
Disciplines
Mathematics
eCommons Citation
Chen, Walter H., "Ramanujan Graphs in the Construction of LDPC Codes" (2004). Undergraduate Mathematics Day: Past Content. 7.
https://ecommons.udayton.edu/mth_epumd/7
2003_UMD_chenAbs.pdf (47 kB)
Abstract
Abstract
