<p>Here are a few examples:</p>

<p>There are the expander codes of Spielman (not to be confused with Sipser-Spielman):
<a href="http://www.cs.yale.edu/homes/spielman/Research/ITsuperc.pdf" rel="nofollow noreferrer">http://www.cs.yale.edu/homes/spielman/Research/ITsuperc.pdf</a></p>

<p>There are the linear-time codes of Guruswami-Indyk:
<a href="https://www.cs.cmu.edu/~venkatg/pubs/papers/lin-zyablov.pdf" rel="nofollow noreferrer">https://www.cs.cmu.edu/~venkatg/pubs/papers/lin-zyablov.pdf</a></p>

<p>There are the expander codes of Zemor:
<a href="https://courses.engr.illinois.edu/cs598sgt/zemor.pdf" rel="nofollow noreferrer">https://courses.engr.illinois.edu/cs598sgt/zemor.pdf</a></p>

CC BY-SA 3.0
2017-03-27T19:15:54.390Z
2017-03-27T19:15:54.390Z
Or Meir
<p>I am looking for families of error-correcting LDPC codes with a constant error fraction corrected by a decoding algorithm. </p>

<p>For example, I know that Sipser and Spielman proved that there is an algorithm that can correct a constant fraction of errors for expander codes (in Expander codes, 1996). </p>

<p>But, is there any equivalent theorem for other families of LDPC codes (like regular LDPC or irregular LDPC, for example)? References would be useful.</p>

<p>Thanks!</p>

CC BY-SA 3.0
2017-03-27T11:01:08.930Z
I do not understand the question. There are plenty of distinct examples of codes that are based on expanders and are analyzed using similar ideas to Sipser-Spielman. Are you looking for LDPC codes that are not based on expanders?
Or Meir
CC BY-SA 3.0
2017-03-27T13:05:17.087Z
I am looking for any LDPC code as long as it can correct any constant fraction of errors. They can be based on expander graphs or not, although I would prefer not based on expanders. Thanks!
P.B.
<co.combinatorics><it.information-theory><coding-theory>
Families of LDPC codes with constant error fraction corrected
P.B.
# Families of LDPC codes with constant error fraction corrected

(Asked by: username_0 on 2017-03-27)

I am looking for families of error-correcting LDPC codes with a constant error fraction corrected by a decoding algorithm.

For example, I know that Sipser and Spielman proved that there is an algorithm that can correct a constant fraction of errors for expander codes (in Expander codes, 1996).

But, is there any equivalent theorem for other families of LDPC codes (like regular LDPC or irregular LDPC, for example)? References would be useful.

Thanks!

**Tags:** co.combinatorics, it.information-theory, coding-theory
> **Comments:**
> **username_1**: I do not understand the question. There are plenty of distinct examples of codes that are based on expanders and are analyzed using similar ideas to Sipser-Spielman. Are you looking for LDPC codes that are not based on expanders?  
> **username_0**: I am looking for any LDPC code as long as it can correct any constant fraction of errors. They can be based on expander graphs or not, although I would prefer not based on expanders. Thanks!  

---

## 1 answers

### Answer by username_1 on 2017-03-27. Score: 2 | Accepted answer

Here are a few examples:

There are the expander codes of Spielman (not to be confused with Sipser-Spielman):
<http://www.cs.yale.edu/homes/spielman/Research/ITsuperc.pdf>

There are the linear-time codes of Guruswami-Indyk:
<https://www.cs.cmu.edu/~venkatg/pubs/papers/lin-zyablov.pdf>

There are the expander codes of Zemor:
<https://courses.engr.illinois.edu/cs598sgt/zemor.pdf>


---

