Skip to main content
Conference Proceedings

Codes and graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1770 1-12
DOI: 10.1007/3-540-46541-3_1
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, I will give a brief introduction to the theory of low-density parity-check codes, and their decoding. I will emphasize the case of correcting erasures as it is still the best understood and most accessible case. At the end of the paper, I will also describe more recent developments.

Cite

CITATION STYLE

APA

Amin Shokrollahi, M. (2000). Codes and graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1770, pp. 1–12). Springer Verlag. https://doi.org/10.1007/3-540-46541-3_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free