book chapter · 2009
Low-density parity-check codes
Cited by 7Abstract and details only
Abstract
Abstract Low-density parity-check (LDPC) codes are among the most efficient error correcting codes in use. This chapter introduces an important family of LDPC ensembles, based on random factor graphs, and studies some of their basic properties. It focuses on performances under optimal decoding, when no constraint is imposed on the computational complexity of the decoding procedure. Bounds in their performances are derived through an analysis of the geometric properties of their codebook. In particular, it shows that appropriately chosen LDPC ensembles allow for communication reliably at rates close to Shannon's capacity.
Cite this paper
Mézard, M., & Montanari, A. (2009). Low-density parity-check codes. https://doi.org/10.1093/acprof:oso/9780198570837.003.0011
Mézard, Marc, and Andrea Montanari. “Low-density parity-check codes.” 2009, pp. 219–40, https://doi.org/10.1093/acprof:oso/9780198570837.003.0011.
Mézard, Marc, and Andrea Montanari. 2009. “Low-density parity-check codes.” https://doi.org/10.1093/acprof:oso/9780198570837.003.0011.
Mézard, M. and Montanari, A. (2009) ‘Low-density parity-check codes’. Available at: https://doi.org/10.1093/acprof:oso/9780198570837.003.0011.
@incollection{mezard2009density,
title = {{Low-density parity-check codes}},
author = {Mézard, Marc and Montanari, Andrea},
pages = {219--240},
year = {2009},
doi = {10.1093/acprof:oso/9780198570837.003.0011}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.