### Abstract

Finite length analysis of low-density parity-check (LDPC) codes with large left degrees was discussed. Recursions for maximum stopping sets were calculated and used for calculating the (average) block- and bit- error probability for regular-degree LDPC codes. The block error probability was related to the code's lowest left degree.

Original language | English (US) |
---|---|

Title of host publication | IEEE International Symposium on Information Theory - Proceedings |

Pages | 3 |

Number of pages | 1 |

State | Published - 2002 |

Externally published | Yes |

Event | 2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland Duration: Jun 30 2002 → Jul 5 2002 |

### Other

Other | 2002 IEEE International Symposium on Information Theory |
---|---|

Country | Switzerland |

City | Lausanne |

Period | 6/30/02 → 7/5/02 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### Cite this

*IEEE International Symposium on Information Theory - Proceedings*(pp. 3)

**Finite-length analysis of LDPC codes with large left degrees.** / Zhang, Junan; Orlitsky, Alon.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE International Symposium on Information Theory - Proceedings.*pp. 3, 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, 6/30/02.

}

TY - GEN

T1 - Finite-length analysis of LDPC codes with large left degrees

AU - Zhang, Junan

AU - Orlitsky, Alon

PY - 2002

Y1 - 2002

N2 - Finite length analysis of low-density parity-check (LDPC) codes with large left degrees was discussed. Recursions for maximum stopping sets were calculated and used for calculating the (average) block- and bit- error probability for regular-degree LDPC codes. The block error probability was related to the code's lowest left degree.

AB - Finite length analysis of low-density parity-check (LDPC) codes with large left degrees was discussed. Recursions for maximum stopping sets were calculated and used for calculating the (average) block- and bit- error probability for regular-degree LDPC codes. The block error probability was related to the code's lowest left degree.

UR - http://www.scopus.com/inward/record.url?scp=0036352495&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036352495&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0036352495

SP - 3

BT - IEEE International Symposium on Information Theory - Proceedings

ER -